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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:28:31,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:28:31,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:28:31,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:28:31,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:28:31,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:28:31,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:28:31,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:28:31,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:28:31,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:28:31,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:28:31,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:28:31,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:28:31,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:28:31,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:28:31,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:28:31,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:28:31,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:28:31,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:28:31,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:28:31,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:28:31,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:28:31,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:28:31,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:28:31,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:28:31,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:28:31,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:28:31,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:28:31,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:28:31,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:28:31,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:28:31,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:28:31,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:28:31,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:28:31,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:28:31,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:28:31,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:28:31,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:28:31,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:28:31,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:28:31,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:28:31,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:28:31,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:28:31,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:28:31,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:28:31,740 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:28:31,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:28:31,740 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:28:31,741 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:28:31,741 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:28:31,743 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:28:31,743 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:28:31,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:28:31,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:28:31,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:28:31,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:28:31,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:28:31,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:28:31,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:28:31,747 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:28:31,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:28:31,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:28:31,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:28:31,747 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:28:31,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:28:31,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:28:31,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:28:31,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:28:31,749 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:28:31,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:28:31,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:28:31,749 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:28:31,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:28:31,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:28:31,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:28:31,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:28:31,829 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:28:31,830 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:28:31,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd478b4d9/dd10bd0ed40a44f89bf281030813e899/FLAGbef16c424 [2019-09-10 07:28:32,385 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:28:32,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:28:32,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd478b4d9/dd10bd0ed40a44f89bf281030813e899/FLAGbef16c424 [2019-09-10 07:28:32,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd478b4d9/dd10bd0ed40a44f89bf281030813e899 [2019-09-10 07:28:32,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:28:32,764 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:28:32,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:28:32,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:28:32,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:28:32,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:28:32" (1/1) ... [2019-09-10 07:28:32,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30948aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:32, skipping insertion in model container [2019-09-10 07:28:32,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:28:32" (1/1) ... [2019-09-10 07:28:32,783 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:28:32,863 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:28:33,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:28:33,308 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:28:33,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:28:33,403 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:28:33,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:33 WrapperNode [2019-09-10 07:28:33,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:28:33,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:28:33,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:28:33,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:28:33,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:33" (1/1) ... [2019-09-10 07:28:33,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:33" (1/1) ... [2019-09-10 07:28:33,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:33" (1/1) ... [2019-09-10 07:28:33,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:33" (1/1) ... [2019-09-10 07:28:33,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:33" (1/1) ... [2019-09-10 07:28:33,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:33" (1/1) ... [2019-09-10 07:28:33,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:33" (1/1) ... [2019-09-10 07:28:33,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:28:33,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:28:33,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:28:33,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:28:33,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-09-10 07:28:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:28:33,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:28:33,528 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:28:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:28:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:28:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:28:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:28:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:28:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:28:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:28:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:28:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:28:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:28:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:28:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:28:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:28:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:28:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:28:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:28:34,152 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:28:34,153 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:28:34,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:28:34 BoogieIcfgContainer [2019-09-10 07:28:34,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:28:34,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:28:34,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:28:34,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:28:34,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:28:32" (1/3) ... [2019-09-10 07:28:34,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6a0212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:28:34, skipping insertion in model container [2019-09-10 07:28:34,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:28:33" (2/3) ... [2019-09-10 07:28:34,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6a0212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:28:34, skipping insertion in model container [2019-09-10 07:28:34,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:28:34" (3/3) ... [2019-09-10 07:28:34,168 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:28:34,179 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:28:34,201 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 07:28:34,220 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 07:28:34,253 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:28:34,254 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:28:34,254 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:28:34,254 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:28:34,254 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:28:34,255 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:28:34,255 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:28:34,256 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:28:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-09-10 07:28:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 07:28:34,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:34,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:34,309 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:34,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:34,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1559662222, now seen corresponding path program 1 times [2019-09-10 07:28:34,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:34,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:34,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:34,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:34,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:34,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:34,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:28:34,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:34,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:28:34,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:28:34,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:28:34,785 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2019-09-10 07:28:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:34,911 INFO L93 Difference]: Finished difference Result 166 states and 264 transitions. [2019-09-10 07:28:34,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:28:34,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-10 07:28:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:34,933 INFO L225 Difference]: With dead ends: 166 [2019-09-10 07:28:34,934 INFO L226 Difference]: Without dead ends: 158 [2019-09-10 07:28:34,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:28:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-10 07:28:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-09-10 07:28:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-10 07:28:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 219 transitions. [2019-09-10 07:28:35,021 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 219 transitions. Word has length 51 [2019-09-10 07:28:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:35,022 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 219 transitions. [2019-09-10 07:28:35,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:28:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2019-09-10 07:28:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:28:35,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:35,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:35,026 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:35,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1275879745, now seen corresponding path program 1 times [2019-09-10 07:28:35,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:35,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:35,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:35,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:28:35,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:35,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:28:35,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:28:35,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:28:35,159 INFO L87 Difference]: Start difference. First operand 156 states and 219 transitions. Second operand 3 states. [2019-09-10 07:28:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:35,222 INFO L93 Difference]: Finished difference Result 201 states and 285 transitions. [2019-09-10 07:28:35,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:28:35,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 07:28:35,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:35,225 INFO L225 Difference]: With dead ends: 201 [2019-09-10 07:28:35,225 INFO L226 Difference]: Without dead ends: 201 [2019-09-10 07:28:35,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:28:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-10 07:28:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-09-10 07:28:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-10 07:28:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 284 transitions. [2019-09-10 07:28:35,246 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 284 transitions. Word has length 52 [2019-09-10 07:28:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:35,246 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 284 transitions. [2019-09-10 07:28:35,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:28:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 284 transitions. [2019-09-10 07:28:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 07:28:35,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:35,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:35,249 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:35,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:35,250 INFO L82 PathProgramCache]: Analyzing trace with hash 920769505, now seen corresponding path program 1 times [2019-09-10 07:28:35,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:35,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:35,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:35,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:35,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:35,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:35,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:28:35,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:35,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:28:35,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:28:35,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:28:35,436 INFO L87 Difference]: Start difference. First operand 199 states and 284 transitions. Second operand 5 states. [2019-09-10 07:28:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:35,642 INFO L93 Difference]: Finished difference Result 348 states and 505 transitions. [2019-09-10 07:28:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:28:35,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-10 07:28:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:35,646 INFO L225 Difference]: With dead ends: 348 [2019-09-10 07:28:35,646 INFO L226 Difference]: Without dead ends: 348 [2019-09-10 07:28:35,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:28:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-10 07:28:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 343. [2019-09-10 07:28:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-10 07:28:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 502 transitions. [2019-09-10 07:28:35,686 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 502 transitions. Word has length 53 [2019-09-10 07:28:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:35,687 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 502 transitions. [2019-09-10 07:28:35,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:28:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 502 transitions. [2019-09-10 07:28:35,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:28:35,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:35,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:35,693 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:35,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:35,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1424755381, now seen corresponding path program 1 times [2019-09-10 07:28:35,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:35,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:35,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:35,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:35,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:35,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:35,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:28:35,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:35,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:28:35,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:28:35,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:28:35,820 INFO L87 Difference]: Start difference. First operand 343 states and 502 transitions. Second operand 5 states. [2019-09-10 07:28:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:35,955 INFO L93 Difference]: Finished difference Result 343 states and 495 transitions. [2019-09-10 07:28:35,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:28:35,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-10 07:28:35,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:35,958 INFO L225 Difference]: With dead ends: 343 [2019-09-10 07:28:35,958 INFO L226 Difference]: Without dead ends: 343 [2019-09-10 07:28:35,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:28:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-10 07:28:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-09-10 07:28:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-10 07:28:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 495 transitions. [2019-09-10 07:28:35,973 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 495 transitions. Word has length 54 [2019-09-10 07:28:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:35,973 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 495 transitions. [2019-09-10 07:28:35,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:28:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 495 transitions. [2019-09-10 07:28:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:28:35,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:35,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:35,976 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:35,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:35,977 INFO L82 PathProgramCache]: Analyzing trace with hash 710908993, now seen corresponding path program 1 times [2019-09-10 07:28:35,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:35,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:35,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:35,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:36,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:36,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:28:36,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:36,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:28:36,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:28:36,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:28:36,063 INFO L87 Difference]: Start difference. First operand 343 states and 495 transitions. Second operand 5 states. [2019-09-10 07:28:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:36,195 INFO L93 Difference]: Finished difference Result 343 states and 488 transitions. [2019-09-10 07:28:36,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:28:36,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-10 07:28:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:36,198 INFO L225 Difference]: With dead ends: 343 [2019-09-10 07:28:36,198 INFO L226 Difference]: Without dead ends: 343 [2019-09-10 07:28:36,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:28:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-10 07:28:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-09-10 07:28:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-10 07:28:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 488 transitions. [2019-09-10 07:28:36,211 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 488 transitions. Word has length 55 [2019-09-10 07:28:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:36,211 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 488 transitions. [2019-09-10 07:28:36,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:28:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 488 transitions. [2019-09-10 07:28:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:28:36,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:36,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:36,213 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:36,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:36,214 INFO L82 PathProgramCache]: Analyzing trace with hash 885426054, now seen corresponding path program 1 times [2019-09-10 07:28:36,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:36,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:36,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:36,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:36,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:36,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:28:36,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:36,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:28:36,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:28:36,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:28:36,309 INFO L87 Difference]: Start difference. First operand 343 states and 488 transitions. Second operand 5 states. [2019-09-10 07:28:36,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:36,419 INFO L93 Difference]: Finished difference Result 912 states and 1320 transitions. [2019-09-10 07:28:36,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:28:36,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 07:28:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:36,425 INFO L225 Difference]: With dead ends: 912 [2019-09-10 07:28:36,425 INFO L226 Difference]: Without dead ends: 912 [2019-09-10 07:28:36,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:28:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-10 07:28:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 520. [2019-09-10 07:28:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-10 07:28:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 751 transitions. [2019-09-10 07:28:36,444 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 751 transitions. Word has length 56 [2019-09-10 07:28:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:36,445 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 751 transitions. [2019-09-10 07:28:36,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:28:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 751 transitions. [2019-09-10 07:28:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:28:36,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:36,446 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:36,447 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1174705316, now seen corresponding path program 1 times [2019-09-10 07:28:36,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:36,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:36,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:36,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:36,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:36,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:36,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:28:36,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:36,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:28:36,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:28:36,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:28:36,571 INFO L87 Difference]: Start difference. First operand 520 states and 751 transitions. Second operand 5 states. [2019-09-10 07:28:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:36,672 INFO L93 Difference]: Finished difference Result 1042 states and 1512 transitions. [2019-09-10 07:28:36,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:28:36,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 07:28:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:36,680 INFO L225 Difference]: With dead ends: 1042 [2019-09-10 07:28:36,680 INFO L226 Difference]: Without dead ends: 1042 [2019-09-10 07:28:36,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:28:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-09-10 07:28:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 780. [2019-09-10 07:28:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-09-10 07:28:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1134 transitions. [2019-09-10 07:28:36,710 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1134 transitions. Word has length 56 [2019-09-10 07:28:36,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:36,711 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 1134 transitions. [2019-09-10 07:28:36,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:28:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1134 transitions. [2019-09-10 07:28:36,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:28:36,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:36,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:36,712 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:36,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:36,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1012396963, now seen corresponding path program 1 times [2019-09-10 07:28:36,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:36,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:36,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:36,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:36,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:36,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:36,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:28:36,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:36,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:28:36,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:28:36,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:28:36,793 INFO L87 Difference]: Start difference. First operand 780 states and 1134 transitions. Second operand 5 states. [2019-09-10 07:28:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:36,910 INFO L93 Difference]: Finished difference Result 1243 states and 1810 transitions. [2019-09-10 07:28:36,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:28:36,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 07:28:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:36,917 INFO L225 Difference]: With dead ends: 1243 [2019-09-10 07:28:36,917 INFO L226 Difference]: Without dead ends: 1243 [2019-09-10 07:28:36,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:28:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2019-09-10 07:28:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 961. [2019-09-10 07:28:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-10 07:28:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1402 transitions. [2019-09-10 07:28:36,949 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1402 transitions. Word has length 56 [2019-09-10 07:28:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:36,949 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1402 transitions. [2019-09-10 07:28:36,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:28:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1402 transitions. [2019-09-10 07:28:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:28:36,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:36,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:36,951 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:36,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1507412779, now seen corresponding path program 1 times [2019-09-10 07:28:36,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:36,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:36,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:36,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:36,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:37,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:37,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:28:37,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:37,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:28:37,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:28:37,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:28:37,236 INFO L87 Difference]: Start difference. First operand 961 states and 1402 transitions. Second operand 10 states. [2019-09-10 07:28:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:38,118 INFO L93 Difference]: Finished difference Result 1869 states and 2720 transitions. [2019-09-10 07:28:38,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:28:38,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-09-10 07:28:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:38,132 INFO L225 Difference]: With dead ends: 1869 [2019-09-10 07:28:38,132 INFO L226 Difference]: Without dead ends: 1869 [2019-09-10 07:28:38,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:28:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-09-10 07:28:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 961. [2019-09-10 07:28:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-10 07:28:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1399 transitions. [2019-09-10 07:28:38,231 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1399 transitions. Word has length 57 [2019-09-10 07:28:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:38,232 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1399 transitions. [2019-09-10 07:28:38,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:28:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1399 transitions. [2019-09-10 07:28:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:28:38,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:38,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:38,234 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:38,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1490525900, now seen corresponding path program 1 times [2019-09-10 07:28:38,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:38,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:38,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:38,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:38,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:38,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:38,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:28:38,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:38,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:28:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:28:38,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:28:38,570 INFO L87 Difference]: Start difference. First operand 961 states and 1399 transitions. Second operand 9 states. [2019-09-10 07:28:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:39,168 INFO L93 Difference]: Finished difference Result 1814 states and 2658 transitions. [2019-09-10 07:28:39,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 07:28:39,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-10 07:28:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:39,183 INFO L225 Difference]: With dead ends: 1814 [2019-09-10 07:28:39,183 INFO L226 Difference]: Without dead ends: 1814 [2019-09-10 07:28:39,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:28:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2019-09-10 07:28:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 961. [2019-09-10 07:28:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-10 07:28:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1398 transitions. [2019-09-10 07:28:39,222 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1398 transitions. Word has length 57 [2019-09-10 07:28:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:39,222 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1398 transitions. [2019-09-10 07:28:39,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:28:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1398 transitions. [2019-09-10 07:28:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:28:39,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:39,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:39,224 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash 640170611, now seen corresponding path program 1 times [2019-09-10 07:28:39,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:39,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:39,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:39,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:39,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:39,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:39,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:28:39,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:39,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:28:39,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:28:39,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:28:39,419 INFO L87 Difference]: Start difference. First operand 961 states and 1398 transitions. Second operand 10 states. [2019-09-10 07:28:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:40,220 INFO L93 Difference]: Finished difference Result 1869 states and 2713 transitions. [2019-09-10 07:28:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:28:40,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-09-10 07:28:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:40,229 INFO L225 Difference]: With dead ends: 1869 [2019-09-10 07:28:40,230 INFO L226 Difference]: Without dead ends: 1869 [2019-09-10 07:28:40,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:28:40,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-09-10 07:28:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 961. [2019-09-10 07:28:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-10 07:28:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1392 transitions. [2019-09-10 07:28:40,269 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1392 transitions. Word has length 58 [2019-09-10 07:28:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:40,269 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1392 transitions. [2019-09-10 07:28:40,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:28:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1392 transitions. [2019-09-10 07:28:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:28:40,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:40,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:40,271 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:40,272 INFO L82 PathProgramCache]: Analyzing trace with hash 783431871, now seen corresponding path program 1 times [2019-09-10 07:28:40,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:40,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:40,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:40,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:40,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:40,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:40,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:28:40,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:40,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:28:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:28:40,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:28:40,971 INFO L87 Difference]: Start difference. First operand 961 states and 1392 transitions. Second operand 21 states. [2019-09-10 07:28:41,148 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:28:41,935 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:28:42,118 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 07:28:42,368 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 07:28:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:45,038 INFO L93 Difference]: Finished difference Result 4515 states and 6653 transitions. [2019-09-10 07:28:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:28:45,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-09-10 07:28:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:45,059 INFO L225 Difference]: With dead ends: 4515 [2019-09-10 07:28:45,059 INFO L226 Difference]: Without dead ends: 4515 [2019-09-10 07:28:45,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=316, Invalid=1490, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:28:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2019-09-10 07:28:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 966. [2019-09-10 07:28:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-09-10 07:28:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1397 transitions. [2019-09-10 07:28:45,117 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1397 transitions. Word has length 59 [2019-09-10 07:28:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:45,118 INFO L475 AbstractCegarLoop]: Abstraction has 966 states and 1397 transitions. [2019-09-10 07:28:45,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:28:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1397 transitions. [2019-09-10 07:28:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:28:45,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:45,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:45,119 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:45,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:45,119 INFO L82 PathProgramCache]: Analyzing trace with hash 125988192, now seen corresponding path program 1 times [2019-09-10 07:28:45,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:45,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:45,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:45,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:45,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:45,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:45,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:28:45,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:45,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:28:45,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:28:45,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:28:45,766 INFO L87 Difference]: Start difference. First operand 966 states and 1397 transitions. Second operand 21 states. [2019-09-10 07:28:46,461 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:28:46,648 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:28:46,856 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:28:47,095 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-10 07:28:47,246 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:28:47,413 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:28:47,589 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:28:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:49,795 INFO L93 Difference]: Finished difference Result 4297 states and 6334 transitions. [2019-09-10 07:28:49,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:28:49,795 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-09-10 07:28:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:49,818 INFO L225 Difference]: With dead ends: 4297 [2019-09-10 07:28:49,818 INFO L226 Difference]: Without dead ends: 4297 [2019-09-10 07:28:49,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=331, Invalid=1475, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:28:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2019-09-10 07:28:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 966. [2019-09-10 07:28:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-09-10 07:28:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1396 transitions. [2019-09-10 07:28:49,891 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1396 transitions. Word has length 59 [2019-09-10 07:28:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:49,891 INFO L475 AbstractCegarLoop]: Abstraction has 966 states and 1396 transitions. [2019-09-10 07:28:49,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:28:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1396 transitions. [2019-09-10 07:28:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:28:49,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:49,893 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:49,893 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1854553764, now seen corresponding path program 1 times [2019-09-10 07:28:49,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:49,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:49,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:50,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:50,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:28:50,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:50,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:28:50,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:28:50,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:28:50,722 INFO L87 Difference]: Start difference. First operand 966 states and 1396 transitions. Second operand 17 states. [2019-09-10 07:28:51,377 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 07:28:51,647 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-10 07:28:51,791 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:28:51,956 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:28:52,167 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:28:52,289 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:28:52,510 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:28:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:53,373 INFO L93 Difference]: Finished difference Result 2819 states and 4144 transitions. [2019-09-10 07:28:53,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:28:53,376 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-09-10 07:28:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:53,388 INFO L225 Difference]: With dead ends: 2819 [2019-09-10 07:28:53,388 INFO L226 Difference]: Without dead ends: 2819 [2019-09-10 07:28:53,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:28:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2019-09-10 07:28:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 961. [2019-09-10 07:28:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-10 07:28:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1387 transitions. [2019-09-10 07:28:53,425 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1387 transitions. Word has length 59 [2019-09-10 07:28:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:53,425 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1387 transitions. [2019-09-10 07:28:53,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:28:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1387 transitions. [2019-09-10 07:28:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:28:53,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:53,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:53,426 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:53,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:53,427 INFO L82 PathProgramCache]: Analyzing trace with hash -573041072, now seen corresponding path program 1 times [2019-09-10 07:28:53,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:53,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:53,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:53,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:53,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:53,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:53,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:28:53,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:53,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:28:53,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:28:53,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:28:53,965 INFO L87 Difference]: Start difference. First operand 961 states and 1387 transitions. Second operand 14 states. [2019-09-10 07:28:54,445 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 07:28:54,646 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 07:28:54,839 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 07:28:54,986 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 07:28:55,328 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 07:28:55,687 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-10 07:28:56,152 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:28:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:56,253 INFO L93 Difference]: Finished difference Result 2996 states and 4415 transitions. [2019-09-10 07:28:56,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:28:56,254 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-09-10 07:28:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:56,279 INFO L225 Difference]: With dead ends: 2996 [2019-09-10 07:28:56,279 INFO L226 Difference]: Without dead ends: 2996 [2019-09-10 07:28:56,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:28:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-09-10 07:28:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 933. [2019-09-10 07:28:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-09-10 07:28:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1351 transitions. [2019-09-10 07:28:56,316 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1351 transitions. Word has length 60 [2019-09-10 07:28:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:56,316 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1351 transitions. [2019-09-10 07:28:56,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:28:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1351 transitions. [2019-09-10 07:28:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:28:56,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:56,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:28:56,317 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2089882996, now seen corresponding path program 1 times [2019-09-10 07:28:56,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:56,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:56,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:56,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:56,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:28:57,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:57,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:28:57,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:57,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:28:57,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:28:57,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:28:57,152 INFO L87 Difference]: Start difference. First operand 933 states and 1351 transitions. Second operand 19 states. [2019-09-10 07:28:57,959 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:28:58,188 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:28:58,877 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 07:29:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:00,416 INFO L93 Difference]: Finished difference Result 4417 states and 6530 transitions. [2019-09-10 07:29:00,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:29:00,416 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-09-10 07:29:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:00,426 INFO L225 Difference]: With dead ends: 4417 [2019-09-10 07:29:00,426 INFO L226 Difference]: Without dead ends: 4417 [2019-09-10 07:29:00,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=299, Invalid=1261, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:29:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2019-09-10 07:29:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 921. [2019-09-10 07:29:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-09-10 07:29:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1334 transitions. [2019-09-10 07:29:00,465 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1334 transitions. Word has length 60 [2019-09-10 07:29:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:00,466 INFO L475 AbstractCegarLoop]: Abstraction has 921 states and 1334 transitions. [2019-09-10 07:29:00,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:29:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1334 transitions. [2019-09-10 07:29:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:29:00,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:00,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:00,467 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:00,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1529221616, now seen corresponding path program 1 times [2019-09-10 07:29:00,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:00,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:00,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:00,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:00,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:01,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:01,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 07:29:01,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:01,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:29:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:29:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:29:01,547 INFO L87 Difference]: Start difference. First operand 921 states and 1334 transitions. Second operand 20 states. [2019-09-10 07:29:02,175 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 07:29:02,318 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:29:02,509 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:29:02,780 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 07:29:02,957 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:29:03,138 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:29:03,415 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:29:03,613 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:29:03,925 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:29:04,120 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:29:04,311 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 07:29:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:05,434 INFO L93 Difference]: Finished difference Result 3370 states and 4972 transitions. [2019-09-10 07:29:05,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:29:05,434 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-09-10 07:29:05,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:05,442 INFO L225 Difference]: With dead ends: 3370 [2019-09-10 07:29:05,442 INFO L226 Difference]: Without dead ends: 3370 [2019-09-10 07:29:05,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=334, Invalid=1306, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:29:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2019-09-10 07:29:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 921. [2019-09-10 07:29:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-09-10 07:29:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1333 transitions. [2019-09-10 07:29:05,469 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1333 transitions. Word has length 60 [2019-09-10 07:29:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:05,469 INFO L475 AbstractCegarLoop]: Abstraction has 921 states and 1333 transitions. [2019-09-10 07:29:05,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:29:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1333 transitions. [2019-09-10 07:29:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:29:05,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:05,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:05,470 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:05,471 INFO L82 PathProgramCache]: Analyzing trace with hash 464532363, now seen corresponding path program 1 times [2019-09-10 07:29:05,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:05,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:05,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:05,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:05,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:05,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:05,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:29:05,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:05,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:29:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:29:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:29:05,891 INFO L87 Difference]: Start difference. First operand 921 states and 1333 transitions. Second operand 13 states. [2019-09-10 07:29:06,287 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-10 07:29:06,443 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:29:06,601 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:29:06,944 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 07:29:07,181 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-10 07:29:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:07,506 INFO L93 Difference]: Finished difference Result 3398 states and 5018 transitions. [2019-09-10 07:29:07,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:29:07,507 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-10 07:29:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:07,514 INFO L225 Difference]: With dead ends: 3398 [2019-09-10 07:29:07,514 INFO L226 Difference]: Without dead ends: 3398 [2019-09-10 07:29:07,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:29:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-09-10 07:29:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 910. [2019-09-10 07:29:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-10 07:29:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1319 transitions. [2019-09-10 07:29:07,541 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1319 transitions. Word has length 60 [2019-09-10 07:29:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:07,542 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1319 transitions. [2019-09-10 07:29:07,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:29:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1319 transitions. [2019-09-10 07:29:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 07:29:07,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:07,543 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:07,543 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:07,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash -22477888, now seen corresponding path program 1 times [2019-09-10 07:29:07,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:07,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:07,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:07,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:07,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:08,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:08,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:29:08,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:08,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:29:08,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:29:08,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:29:08,454 INFO L87 Difference]: Start difference. First operand 910 states and 1319 transitions. Second operand 17 states. [2019-09-10 07:29:09,228 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 07:29:09,435 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:29:09,577 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:29:09,736 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:29:09,884 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:29:10,013 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:29:10,160 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:29:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:11,323 INFO L93 Difference]: Finished difference Result 2562 states and 3778 transitions. [2019-09-10 07:29:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:29:11,324 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-10 07:29:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:11,329 INFO L225 Difference]: With dead ends: 2562 [2019-09-10 07:29:11,329 INFO L226 Difference]: Without dead ends: 2553 [2019-09-10 07:29:11,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 07:29:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-09-10 07:29:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 891. [2019-09-10 07:29:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-09-10 07:29:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1299 transitions. [2019-09-10 07:29:11,356 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1299 transitions. Word has length 61 [2019-09-10 07:29:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:11,356 INFO L475 AbstractCegarLoop]: Abstraction has 891 states and 1299 transitions. [2019-09-10 07:29:11,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:29:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1299 transitions. [2019-09-10 07:29:11,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:29:11,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:11,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:11,362 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:11,363 INFO L82 PathProgramCache]: Analyzing trace with hash 161317224, now seen corresponding path program 1 times [2019-09-10 07:29:11,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:11,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:11,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:11,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:11,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:11,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:11,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:11,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:11,418 INFO L87 Difference]: Start difference. First operand 891 states and 1299 transitions. Second operand 3 states. [2019-09-10 07:29:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:11,452 INFO L93 Difference]: Finished difference Result 1581 states and 2260 transitions. [2019-09-10 07:29:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:11,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:29:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:11,456 INFO L225 Difference]: With dead ends: 1581 [2019-09-10 07:29:11,456 INFO L226 Difference]: Without dead ends: 1581 [2019-09-10 07:29:11,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2019-09-10 07:29:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1559. [2019-09-10 07:29:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2019-09-10 07:29:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2239 transitions. [2019-09-10 07:29:11,476 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2239 transitions. Word has length 79 [2019-09-10 07:29:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:11,476 INFO L475 AbstractCegarLoop]: Abstraction has 1559 states and 2239 transitions. [2019-09-10 07:29:11,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2239 transitions. [2019-09-10 07:29:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:29:11,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:11,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:11,478 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:11,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:11,478 INFO L82 PathProgramCache]: Analyzing trace with hash 954765304, now seen corresponding path program 1 times [2019-09-10 07:29:11,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:11,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:11,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:11,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:11,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:11,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:11,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:11,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:11,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:11,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:11,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:11,519 INFO L87 Difference]: Start difference. First operand 1559 states and 2239 transitions. Second operand 3 states. [2019-09-10 07:29:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:11,547 INFO L93 Difference]: Finished difference Result 2059 states and 2931 transitions. [2019-09-10 07:29:11,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:11,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:29:11,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:11,552 INFO L225 Difference]: With dead ends: 2059 [2019-09-10 07:29:11,552 INFO L226 Difference]: Without dead ends: 2059 [2019-09-10 07:29:11,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2019-09-10 07:29:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2035. [2019-09-10 07:29:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-09-10 07:29:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2906 transitions. [2019-09-10 07:29:11,578 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2906 transitions. Word has length 80 [2019-09-10 07:29:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:11,578 INFO L475 AbstractCegarLoop]: Abstraction has 2035 states and 2906 transitions. [2019-09-10 07:29:11,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2906 transitions. [2019-09-10 07:29:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:29:11,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:11,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:11,580 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:11,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash 271546837, now seen corresponding path program 1 times [2019-09-10 07:29:11,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:11,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:11,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:11,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:11,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:29:11,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:11,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:29:11,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:29:11,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:29:11,667 INFO L87 Difference]: Start difference. First operand 2035 states and 2906 transitions. Second operand 6 states. [2019-09-10 07:29:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:11,742 INFO L93 Difference]: Finished difference Result 3455 states and 4879 transitions. [2019-09-10 07:29:11,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:29:11,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-09-10 07:29:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:11,751 INFO L225 Difference]: With dead ends: 3455 [2019-09-10 07:29:11,751 INFO L226 Difference]: Without dead ends: 3455 [2019-09-10 07:29:11,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:29:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2019-09-10 07:29:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 2059. [2019-09-10 07:29:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2019-09-10 07:29:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2920 transitions. [2019-09-10 07:29:11,787 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2920 transitions. Word has length 80 [2019-09-10 07:29:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:11,787 INFO L475 AbstractCegarLoop]: Abstraction has 2059 states and 2920 transitions. [2019-09-10 07:29:11,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:29:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2920 transitions. [2019-09-10 07:29:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:29:11,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:11,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:11,789 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:11,790 INFO L82 PathProgramCache]: Analyzing trace with hash -109706295, now seen corresponding path program 1 times [2019-09-10 07:29:11,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:11,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:11,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:11,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:11,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:11,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:11,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:11,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:11,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:11,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:11,859 INFO L87 Difference]: Start difference. First operand 2059 states and 2920 transitions. Second operand 3 states. [2019-09-10 07:29:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:11,893 INFO L93 Difference]: Finished difference Result 3801 states and 5278 transitions. [2019-09-10 07:29:11,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:11,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:29:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:11,902 INFO L225 Difference]: With dead ends: 3801 [2019-09-10 07:29:11,902 INFO L226 Difference]: Without dead ends: 3801 [2019-09-10 07:29:11,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2019-09-10 07:29:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 3559. [2019-09-10 07:29:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2019-09-10 07:29:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 4977 transitions. [2019-09-10 07:29:11,961 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 4977 transitions. Word has length 81 [2019-09-10 07:29:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:11,962 INFO L475 AbstractCegarLoop]: Abstraction has 3559 states and 4977 transitions. [2019-09-10 07:29:11,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 4977 transitions. [2019-09-10 07:29:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:29:11,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:11,964 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:11,965 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1521581427, now seen corresponding path program 1 times [2019-09-10 07:29:11,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:11,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:11,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:12,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:12,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:12,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:12,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:12,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:12,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:12,036 INFO L87 Difference]: Start difference. First operand 3559 states and 4977 transitions. Second operand 3 states. [2019-09-10 07:29:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:12,060 INFO L93 Difference]: Finished difference Result 4497 states and 6154 transitions. [2019-09-10 07:29:12,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:12,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:29:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:12,069 INFO L225 Difference]: With dead ends: 4497 [2019-09-10 07:29:12,069 INFO L226 Difference]: Without dead ends: 4497 [2019-09-10 07:29:12,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2019-09-10 07:29:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 4191. [2019-09-10 07:29:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4191 states. [2019-09-10 07:29:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 5735 transitions. [2019-09-10 07:29:12,148 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 5735 transitions. Word has length 82 [2019-09-10 07:29:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:12,148 INFO L475 AbstractCegarLoop]: Abstraction has 4191 states and 5735 transitions. [2019-09-10 07:29:12,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 5735 transitions. [2019-09-10 07:29:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:29:12,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:12,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:12,150 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:12,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1799551662, now seen corresponding path program 1 times [2019-09-10 07:29:12,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:12,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:12,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:12,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:12,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:12,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:12,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:29:12,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:12,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:29:12,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:29:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:29:12,234 INFO L87 Difference]: Start difference. First operand 4191 states and 5735 transitions. Second operand 7 states. [2019-09-10 07:29:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:12,586 INFO L93 Difference]: Finished difference Result 9553 states and 12780 transitions. [2019-09-10 07:29:12,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:29:12,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-10 07:29:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:12,598 INFO L225 Difference]: With dead ends: 9553 [2019-09-10 07:29:12,599 INFO L226 Difference]: Without dead ends: 9553 [2019-09-10 07:29:12,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:29:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9553 states. [2019-09-10 07:29:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9553 to 4875. [2019-09-10 07:29:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4875 states. [2019-09-10 07:29:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6685 transitions. [2019-09-10 07:29:12,689 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6685 transitions. Word has length 82 [2019-09-10 07:29:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:12,689 INFO L475 AbstractCegarLoop]: Abstraction has 4875 states and 6685 transitions. [2019-09-10 07:29:12,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:29:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6685 transitions. [2019-09-10 07:29:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:29:12,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:12,692 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:12,692 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash -74285142, now seen corresponding path program 1 times [2019-09-10 07:29:12,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:12,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:12,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:12,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:12,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:12,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:12,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:12,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:12,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:12,754 INFO L87 Difference]: Start difference. First operand 4875 states and 6685 transitions. Second operand 3 states. [2019-09-10 07:29:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:12,785 INFO L93 Difference]: Finished difference Result 8949 states and 11916 transitions. [2019-09-10 07:29:12,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:12,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 07:29:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:12,796 INFO L225 Difference]: With dead ends: 8949 [2019-09-10 07:29:12,796 INFO L226 Difference]: Without dead ends: 8949 [2019-09-10 07:29:12,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8949 states. [2019-09-10 07:29:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8949 to 7995. [2019-09-10 07:29:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7995 states. [2019-09-10 07:29:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7995 states to 7995 states and 10725 transitions. [2019-09-10 07:29:12,891 INFO L78 Accepts]: Start accepts. Automaton has 7995 states and 10725 transitions. Word has length 103 [2019-09-10 07:29:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:12,891 INFO L475 AbstractCegarLoop]: Abstraction has 7995 states and 10725 transitions. [2019-09-10 07:29:12,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7995 states and 10725 transitions. [2019-09-10 07:29:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:29:12,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:12,894 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:29:12,894 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:12,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:12,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1887526267, now seen corresponding path program 1 times [2019-09-10 07:29:12,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:12,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:12,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:12,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:12,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:13,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:29:13,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:29:13,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 07:29:13,155 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [176], [178], [181], [189], [191], [194], [202], [204], [207], [210], [214], [216], [218], [221], [222], [224], [226], [231], [233], [236], [249], [251], [254], [257], [259], [274], [276], [279], [282], [284], [299], [301], [303], [306], [309], [311], [389], [390], [394], [395], [396] [2019-09-10 07:29:13,204 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:29:13,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:29:13,327 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:29:13,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:29:13,871 INFO L272 AbstractInterpreter]: Visited 97 different actions 501 times. Merged at 38 different actions 348 times. Widened at 14 different actions 44 times. Performed 1625 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1625 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 59 fixpoints after 15 different actions. Largest state had 110 variables. [2019-09-10 07:29:13,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:13,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:29:13,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:29:13,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:29:13,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:13,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:29:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:14,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:29:14,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:29:14,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:14,726 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:29:14,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:15,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:15,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:16,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:17,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:29:17,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2019-09-10 07:29:17,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:29:17,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:29:17,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:29:17,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:29:17,030 INFO L87 Difference]: Start difference. First operand 7995 states and 10725 transitions. Second operand 20 states. [2019-09-10 07:29:18,981 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:29:20,829 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:29:21,051 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:29:21,559 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:29:21,715 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:29:21,868 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:29:22,318 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:29:22,482 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:29:22,705 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:29:23,185 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:29:23,381 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 07:29:24,659 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:29:25,037 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:29:25,371 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:29:25,564 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:29:25,721 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:29:25,905 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:29:26,699 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:29:26,925 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:29:27,455 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:29:27,636 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:29:28,234 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:29:29,005 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:29:29,344 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:29:29,668 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:29:31,023 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:29:32,854 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:29:33,091 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:29:33,341 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:29:33,549 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:29:34,126 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:29:34,336 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:29:34,570 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:29:35,069 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:29:35,295 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:29:35,550 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:29:35,851 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:29:36,111 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:29:36,304 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:29:37,046 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:29:37,362 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:29:37,599 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:29:37,893 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:29:38,075 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:29:38,247 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:29:38,462 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:29:38,650 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:29:38,846 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:29:39,140 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:29:39,690 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:29:40,711 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 07:29:40,989 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 07:29:41,591 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:29:41,828 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:29:42,197 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:29:42,429 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 07:29:42,640 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 07:29:42,868 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:29:43,047 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:29:43,276 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:29:43,583 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:29:43,828 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:29:44,168 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:29:44,644 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:29:45,241 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:29:45,553 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:29:45,821 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:29:46,221 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:29:46,713 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 07:29:46,927 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 07:29:47,201 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:29:47,578 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 07:29:47,760 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:29:47,938 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:29:48,107 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:29:48,380 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:29:48,560 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:29:48,814 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:29:48,983 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:29:49,156 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:29:49,512 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:29:49,851 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:29:50,265 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:29:50,509 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:29:50,745 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:29:51,114 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:29:51,467 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:29:51,852 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:29:52,083 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:29:52,469 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:29:52,658 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:29:53,039 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:29:53,328 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:29:53,491 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-10 07:29:53,698 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:29:53,870 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:29:54,099 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:29:54,281 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:29:54,487 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:29:54,664 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:29:55,134 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:29:55,299 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:29:55,460 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:29:55,669 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:29:55,911 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:29:56,098 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:29:56,265 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:29:56,514 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:29:56,731 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:29:56,934 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:29:57,112 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:29:57,298 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 07:29:57,690 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:29:58,154 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:29:58,802 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 07:29:59,348 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:29:59,588 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:29:59,773 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:30:00,197 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 07:30:00,464 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 07:30:00,642 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:30:00,998 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 07:30:01,399 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:30:01,668 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:30:01,928 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 07:30:02,278 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 07:30:03,436 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 07:30:03,608 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:30:03,825 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:30:04,066 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 07:30:04,399 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 07:30:05,386 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:30:06,013 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-10 07:30:06,671 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:30:06,899 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:30:07,584 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:30:07,978 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 07:30:08,230 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:30:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:08,540 INFO L93 Difference]: Finished difference Result 133041 states and 171398 transitions. [2019-09-10 07:30:08,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-09-10 07:30:08,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-10 07:30:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:08,849 INFO L225 Difference]: With dead ends: 133041 [2019-09-10 07:30:08,850 INFO L226 Difference]: Without dead ends: 133041 [2019-09-10 07:30:08,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 161 SyntacticMatches, 29 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29222 ImplicationChecksByTransitivity, 45.1s TimeCoverageRelationStatistics Valid=10946, Invalid=62766, Unknown=0, NotChecked=0, Total=73712 [2019-09-10 07:30:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133041 states. [2019-09-10 07:30:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133041 to 29848. [2019-09-10 07:30:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29848 states. [2019-09-10 07:30:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29848 states to 29848 states and 39643 transitions. [2019-09-10 07:30:11,242 INFO L78 Accepts]: Start accepts. Automaton has 29848 states and 39643 transitions. Word has length 104 [2019-09-10 07:30:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:11,242 INFO L475 AbstractCegarLoop]: Abstraction has 29848 states and 39643 transitions. [2019-09-10 07:30:11,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:30:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 29848 states and 39643 transitions. [2019-09-10 07:30:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:30:11,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:11,251 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:30:11,251 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2056347745, now seen corresponding path program 1 times [2019-09-10 07:30:11,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:11,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:11,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:11,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:30:11,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:30:11,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:30:11,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:30:11,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:30:11,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:30:11,328 INFO L87 Difference]: Start difference. First operand 29848 states and 39643 transitions. Second operand 3 states. [2019-09-10 07:30:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:11,402 INFO L93 Difference]: Finished difference Result 25533 states and 32624 transitions. [2019-09-10 07:30:11,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:30:11,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 07:30:11,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:11,446 INFO L225 Difference]: With dead ends: 25533 [2019-09-10 07:30:11,447 INFO L226 Difference]: Without dead ends: 25533 [2019-09-10 07:30:11,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:30:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25533 states. [2019-09-10 07:30:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25533 to 25461. [2019-09-10 07:30:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25461 states. [2019-09-10 07:30:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25461 states to 25461 states and 32539 transitions. [2019-09-10 07:30:11,829 INFO L78 Accepts]: Start accepts. Automaton has 25461 states and 32539 transitions. Word has length 104 [2019-09-10 07:30:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:11,829 INFO L475 AbstractCegarLoop]: Abstraction has 25461 states and 32539 transitions. [2019-09-10 07:30:11,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:30:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 25461 states and 32539 transitions. [2019-09-10 07:30:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:30:11,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:11,836 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-09-10 07:30:11,836 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2017194729, now seen corresponding path program 1 times [2019-09-10 07:30:11,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:11,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:11,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:11,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:11,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:12,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:12,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:30:12,456 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 07:30:12,457 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [189], [191], [194], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [249], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [389], [390], [394], [395], [396] [2019-09-10 07:30:12,466 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:30:12,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:30:12,488 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:30:12,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:30:12,759 INFO L272 AbstractInterpreter]: Visited 99 different actions 446 times. Merged at 41 different actions 308 times. Widened at 14 different actions 49 times. Performed 1487 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1487 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 12 different actions. Largest state had 110 variables. [2019-09-10 07:30:12,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:12,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:30:12,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:12,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:30:12,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:12,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:30:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:12,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:30:12,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:30:13,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:13,482 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:30:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:15,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:15,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:30:15,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:30:15,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:30:15,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:30:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:30:15,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:30:15,228 INFO L87 Difference]: Start difference. First operand 25461 states and 32539 transitions. Second operand 20 states. [2019-09-10 07:30:15,706 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:30:16,357 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:30:16,673 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:30:17,171 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:30:17,363 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:30:17,582 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:30:17,846 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:30:18,223 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:30:18,792 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:30:19,161 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:30:19,357 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:30:19,829 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:30:20,165 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:30:20,473 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:30:20,704 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:30:20,916 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:30:21,220 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:30:21,387 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:30:21,698 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:30:22,012 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:30:22,341 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:30:22,709 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 07:30:23,190 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:30:23,378 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:30:23,632 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:30:23,853 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:30:24,142 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:30:24,363 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:30:24,704 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:30:24,924 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:30:25,372 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:30:25,719 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:30:25,911 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:30:26,527 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 07:30:27,074 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:30:27,339 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:30:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:27,472 INFO L93 Difference]: Finished difference Result 130165 states and 163658 transitions. [2019-09-10 07:30:27,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 07:30:27,472 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2019-09-10 07:30:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:27,660 INFO L225 Difference]: With dead ends: 130165 [2019-09-10 07:30:27,660 INFO L226 Difference]: Without dead ends: 130165 [2019-09-10 07:30:27,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 181 SyntacticMatches, 16 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1173, Invalid=2987, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 07:30:27,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130165 states. [2019-09-10 07:30:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130165 to 61925. [2019-09-10 07:30:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61925 states. [2019-09-10 07:30:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61925 states to 61925 states and 79011 transitions. [2019-09-10 07:30:30,126 INFO L78 Accepts]: Start accepts. Automaton has 61925 states and 79011 transitions. Word has length 105 [2019-09-10 07:30:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:30,127 INFO L475 AbstractCegarLoop]: Abstraction has 61925 states and 79011 transitions. [2019-09-10 07:30:30,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:30:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 61925 states and 79011 transitions. [2019-09-10 07:30:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:30:30,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:30,143 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-09-10 07:30:30,143 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:30,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:30,143 INFO L82 PathProgramCache]: Analyzing trace with hash -530573863, now seen corresponding path program 1 times [2019-09-10 07:30:30,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:30,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:30,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:30,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:30,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:30:30,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:30:30,480 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [141], [144], [148], [151], [154], [158], [160], [163], [168], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [299], [301], [303], [306], [309], [311], [329], [334], [389], [390], [394], [395], [396] [2019-09-10 07:30:30,483 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:30:30,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:30:30,497 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:30:30,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:30:30,667 INFO L272 AbstractInterpreter]: Visited 100 different actions 334 times. Merged at 41 different actions 206 times. Widened at 8 different actions 12 times. Performed 1175 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1175 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 6 different actions. Largest state had 110 variables. [2019-09-10 07:30:30,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:30,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:30:30,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:30,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:30:30,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:30,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:30:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:30,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:30:30,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:30:30,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:30,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:30,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:31,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:30:31,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:31,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:31,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:31,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:31,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:32,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:32,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:30:32,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:30:32,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:30:32,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:30:32,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:30:32,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:30:32,345 INFO L87 Difference]: Start difference. First operand 61925 states and 79011 transitions. Second operand 20 states. [2019-09-10 07:30:33,893 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2019-09-10 07:30:35,425 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-09-10 07:30:38,066 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-09-10 07:30:38,320 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-09-10 07:30:38,712 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-09-10 07:30:38,995 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-10 07:30:39,201 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2019-09-10 07:30:40,117 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 37 [2019-09-10 07:30:40,398 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2019-09-10 07:30:42,116 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-10 07:30:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:43,347 INFO L93 Difference]: Finished difference Result 234345 states and 298034 transitions. [2019-09-10 07:30:43,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-10 07:30:43,347 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-10 07:30:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:43,636 INFO L225 Difference]: With dead ends: 234345 [2019-09-10 07:30:43,636 INFO L226 Difference]: Without dead ends: 234345 [2019-09-10 07:30:43,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 168 SyntacticMatches, 26 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3397 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2280, Invalid=8850, Unknown=0, NotChecked=0, Total=11130 [2019-09-10 07:30:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234345 states. [2019-09-10 07:30:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234345 to 94931. [2019-09-10 07:30:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94931 states. [2019-09-10 07:30:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94931 states to 94931 states and 120683 transitions. [2019-09-10 07:30:45,490 INFO L78 Accepts]: Start accepts. Automaton has 94931 states and 120683 transitions. Word has length 106 [2019-09-10 07:30:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:45,490 INFO L475 AbstractCegarLoop]: Abstraction has 94931 states and 120683 transitions. [2019-09-10 07:30:45,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:30:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 94931 states and 120683 transitions. [2019-09-10 07:30:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:30:45,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:45,507 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:30:45,507 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash 795611084, now seen corresponding path program 1 times [2019-09-10 07:30:45,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:45,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:45,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:45,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:45,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:45,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:30:45,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:30:45,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:30:45,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:30:45,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:30:45,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:30:45,576 INFO L87 Difference]: Start difference. First operand 94931 states and 120683 transitions. Second operand 3 states. [2019-09-10 07:30:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:46,172 INFO L93 Difference]: Finished difference Result 52027 states and 65142 transitions. [2019-09-10 07:30:46,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:30:46,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:30:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:46,227 INFO L225 Difference]: With dead ends: 52027 [2019-09-10 07:30:46,228 INFO L226 Difference]: Without dead ends: 52027 [2019-09-10 07:30:46,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:30:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2019-09-10 07:30:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 52025. [2019-09-10 07:30:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52025 states. [2019-09-10 07:30:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52025 states to 52025 states and 65141 transitions. [2019-09-10 07:30:46,705 INFO L78 Accepts]: Start accepts. Automaton has 52025 states and 65141 transitions. Word has length 106 [2019-09-10 07:30:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:46,706 INFO L475 AbstractCegarLoop]: Abstraction has 52025 states and 65141 transitions. [2019-09-10 07:30:46,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:30:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 52025 states and 65141 transitions. [2019-09-10 07:30:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:30:46,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:46,713 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-09-10 07:30:46,714 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:46,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:46,714 INFO L82 PathProgramCache]: Analyzing trace with hash -839839732, now seen corresponding path program 1 times [2019-09-10 07:30:46,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:46,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:46,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:46,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:47,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:47,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:30:47,225 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:30:47,225 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [389], [390], [394], [395], [396] [2019-09-10 07:30:47,231 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:30:47,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:30:47,257 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:30:47,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:30:47,485 INFO L272 AbstractInterpreter]: Visited 100 different actions 464 times. Merged at 42 different actions 324 times. Widened at 13 different actions 47 times. Performed 1523 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1523 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 11 different actions. Largest state had 110 variables. [2019-09-10 07:30:47,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:47,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:30:47,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:47,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:30:47,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:47,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:30:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:47,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 07:30:47,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:30:48,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,637 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 29 [2019-09-10 07:30:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:48,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:30:49,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:30:49,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:50,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:50,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:50,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:50,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:30:51,071 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:30:51,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [19] total 53 [2019-09-10 07:30:51,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:30:51,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:30:51,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:30:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2510, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 07:30:51,073 INFO L87 Difference]: Start difference. First operand 52025 states and 65141 transitions. Second operand 20 states. [2019-09-10 07:30:52,219 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:30:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:53,862 INFO L93 Difference]: Finished difference Result 87749 states and 110042 transitions. [2019-09-10 07:30:53,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:30:53,862 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-10 07:30:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:53,939 INFO L225 Difference]: With dead ends: 87749 [2019-09-10 07:30:53,939 INFO L226 Difference]: Without dead ends: 87749 [2019-09-10 07:30:53,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 175 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=530, Invalid=3760, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 07:30:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87749 states. [2019-09-10 07:30:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87749 to 52019. [2019-09-10 07:30:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52019 states. [2019-09-10 07:30:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52019 states to 52019 states and 65134 transitions. [2019-09-10 07:30:54,496 INFO L78 Accepts]: Start accepts. Automaton has 52019 states and 65134 transitions. Word has length 106 [2019-09-10 07:30:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:54,496 INFO L475 AbstractCegarLoop]: Abstraction has 52019 states and 65134 transitions. [2019-09-10 07:30:54,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:30:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 52019 states and 65134 transitions. [2019-09-10 07:30:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:30:54,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:54,502 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-09-10 07:30:54,502 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:54,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2059640868, now seen corresponding path program 1 times [2019-09-10 07:30:54,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:54,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:54,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:54,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:54,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:55,678 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 12 [2019-09-10 07:30:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:55,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:55,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:30:55,865 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:30:55,865 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [189], [191], [194], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [249], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [339], [344], [389], [390], [394], [395], [396] [2019-09-10 07:30:55,871 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:30:55,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:30:55,882 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:30:56,169 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:30:56,170 INFO L272 AbstractInterpreter]: Visited 100 different actions 419 times. Merged at 41 different actions 283 times. Widened at 13 different actions 37 times. Performed 1392 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1392 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 9 different actions. Largest state had 110 variables. [2019-09-10 07:30:56,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:56,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:30:56,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:30:56,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:30:56,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:56,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:30:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:56,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:30:56,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:30:56,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:56,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:56,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:56,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:56,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:30:56,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:56,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:56,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:56,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:56,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:57,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:30:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:30:57,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:30:57,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2019-09-10 07:30:57,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:30:57,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:30:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:30:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:30:57,485 INFO L87 Difference]: Start difference. First operand 52019 states and 65134 transitions. Second operand 21 states. [2019-09-10 07:31:02,936 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-10 07:31:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:05,395 INFO L93 Difference]: Finished difference Result 167851 states and 207496 transitions. [2019-09-10 07:31:05,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-10 07:31:05,395 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-09-10 07:31:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:05,559 INFO L225 Difference]: With dead ends: 167851 [2019-09-10 07:31:05,560 INFO L226 Difference]: Without dead ends: 167851 [2019-09-10 07:31:05,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 178 SyntacticMatches, 13 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1994, Invalid=8308, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 07:31:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167851 states. [2019-09-10 07:31:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167851 to 51995. [2019-09-10 07:31:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51995 states. [2019-09-10 07:31:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51995 states to 51995 states and 65109 transitions. [2019-09-10 07:31:06,443 INFO L78 Accepts]: Start accepts. Automaton has 51995 states and 65109 transitions. Word has length 106 [2019-09-10 07:31:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:06,444 INFO L475 AbstractCegarLoop]: Abstraction has 51995 states and 65109 transitions. [2019-09-10 07:31:06,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:31:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 51995 states and 65109 transitions. [2019-09-10 07:31:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:31:06,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:06,447 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-09-10 07:31:06,447 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1416503901, now seen corresponding path program 1 times [2019-09-10 07:31:06,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:06,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:06,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:06,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:06,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:06,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:06,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:06,779 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:31:06,780 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [274], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [349], [354], [389], [390], [394], [395], [396] [2019-09-10 07:31:06,781 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:06,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:06,915 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:07,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:07,079 INFO L272 AbstractInterpreter]: Visited 100 different actions 389 times. Merged at 41 different actions 255 times. Widened at 11 different actions 27 times. Performed 1292 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1292 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 9 different actions. Largest state had 110 variables. [2019-09-10 07:31:07,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:07,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:07,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:07,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:07,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:07,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:31:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:07,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 07:31:07,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:07,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:07,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:07,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:08,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:08,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:08,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 36 [2019-09-10 07:31:08,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:08,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 07:31:08,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 07:31:08,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 07:31:08,609 INFO L87 Difference]: Start difference. First operand 51995 states and 65109 transitions. Second operand 27 states. [2019-09-10 07:31:12,112 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-10 07:31:15,455 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 07:31:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:17,624 INFO L93 Difference]: Finished difference Result 136365 states and 169412 transitions. [2019-09-10 07:31:17,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 07:31:17,624 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 106 [2019-09-10 07:31:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:17,767 INFO L225 Difference]: With dead ends: 136365 [2019-09-10 07:31:17,767 INFO L226 Difference]: Without dead ends: 136365 [2019-09-10 07:31:17,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1763, Invalid=6793, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 07:31:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136365 states. [2019-09-10 07:31:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136365 to 51977. [2019-09-10 07:31:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51977 states. [2019-09-10 07:31:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51977 states to 51977 states and 65090 transitions. [2019-09-10 07:31:18,557 INFO L78 Accepts]: Start accepts. Automaton has 51977 states and 65090 transitions. Word has length 106 [2019-09-10 07:31:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:18,558 INFO L475 AbstractCegarLoop]: Abstraction has 51977 states and 65090 transitions. [2019-09-10 07:31:18,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 07:31:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 51977 states and 65090 transitions. [2019-09-10 07:31:18,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:31:18,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:18,561 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:18,561 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:18,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:18,561 INFO L82 PathProgramCache]: Analyzing trace with hash -897654530, now seen corresponding path program 1 times [2019-09-10 07:31:18,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:18,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:18,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:18,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:18,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:18,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:18,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:18,878 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:31:18,879 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [329], [334], [389], [390], [394], [395], [396] [2019-09-10 07:31:18,881 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:18,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:18,895 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:19,088 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:19,089 INFO L272 AbstractInterpreter]: Visited 101 different actions 408 times. Merged at 42 different actions 272 times. Widened at 11 different actions 28 times. Performed 1385 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1385 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 12 different actions. Largest state had 110 variables. [2019-09-10 07:31:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:19,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:19,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:19,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:31:19,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:19,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:19,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:31:19,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:19,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:19,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:19,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:19,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:19,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:20,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:20,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:20,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:20,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:20,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:20,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:20,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:31:20,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:20,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 27 [2019-09-10 07:31:20,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:20,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:31:20,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:31:20,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:31:20,150 INFO L87 Difference]: Start difference. First operand 51977 states and 65090 transitions. Second operand 22 states. [2019-09-10 07:31:22,312 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2019-09-10 07:31:23,112 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2019-09-10 07:31:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:23,420 INFO L93 Difference]: Finished difference Result 97321 states and 122236 transitions. [2019-09-10 07:31:23,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 07:31:23,421 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2019-09-10 07:31:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:23,514 INFO L225 Difference]: With dead ends: 97321 [2019-09-10 07:31:23,514 INFO L226 Difference]: Without dead ends: 97321 [2019-09-10 07:31:23,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 197 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=570, Invalid=1980, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:31:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97321 states. [2019-09-10 07:31:24,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97321 to 68761. [2019-09-10 07:31:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68761 states. [2019-09-10 07:31:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68761 states to 68761 states and 86097 transitions. [2019-09-10 07:31:24,230 INFO L78 Accepts]: Start accepts. Automaton has 68761 states and 86097 transitions. Word has length 107 [2019-09-10 07:31:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:24,231 INFO L475 AbstractCegarLoop]: Abstraction has 68761 states and 86097 transitions. [2019-09-10 07:31:24,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:31:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 68761 states and 86097 transitions. [2019-09-10 07:31:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:31:24,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:24,236 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:24,236 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:24,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash -392861189, now seen corresponding path program 1 times [2019-09-10 07:31:24,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:24,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:24,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:24,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:24,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:24,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:31:24,662 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [128], [130], [133], [136], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [174], [176], [178], [181], [184], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [267], [270], [276], [279], [282], [284], [301], [303], [306], [309], [311], [329], [334], [389], [390], [394], [395], [396] [2019-09-10 07:31:24,666 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:24,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:24,677 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:24,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:24,835 INFO L272 AbstractInterpreter]: Visited 101 different actions 377 times. Merged at 42 different actions 244 times. Widened at 12 different actions 26 times. Performed 1263 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1263 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 11 different actions. Largest state had 110 variables. [2019-09-10 07:31:24,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:24,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:24,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:24,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:24,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:24,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:31:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:24,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 07:31:24,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:25,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:25,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:26,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:26,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:27,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:27,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:27,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:28,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:28,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:29,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:31:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:29,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:29,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 22] total 59 [2019-09-10 07:31:29,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:29,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 07:31:29,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 07:31:29,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3152, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 07:31:29,572 INFO L87 Difference]: Start difference. First operand 68761 states and 86097 transitions. Second operand 39 states. [2019-09-10 07:31:34,726 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 07:31:35,006 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:31:35,384 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:31:35,776 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:31:38,578 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:31:38,998 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:31:39,312 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 07:31:40,426 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 07:31:40,676 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:31:43,618 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:31:50,912 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:31:53,532 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 07:31:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:56,660 INFO L93 Difference]: Finished difference Result 182589 states and 228389 transitions. [2019-09-10 07:31:56,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-10 07:31:56,660 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 107 [2019-09-10 07:31:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:56,840 INFO L225 Difference]: With dead ends: 182589 [2019-09-10 07:31:56,840 INFO L226 Difference]: Without dead ends: 182589 [2019-09-10 07:31:56,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 167 SyntacticMatches, 8 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7943 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=4160, Invalid=25252, Unknown=0, NotChecked=0, Total=29412 [2019-09-10 07:31:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182589 states. [2019-09-10 07:31:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182589 to 89692. [2019-09-10 07:31:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89692 states. [2019-09-10 07:31:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89692 states to 89692 states and 112311 transitions. [2019-09-10 07:31:58,191 INFO L78 Accepts]: Start accepts. Automaton has 89692 states and 112311 transitions. Word has length 107 [2019-09-10 07:31:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:58,191 INFO L475 AbstractCegarLoop]: Abstraction has 89692 states and 112311 transitions. [2019-09-10 07:31:58,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 07:31:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 89692 states and 112311 transitions. [2019-09-10 07:31:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:31:58,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:58,197 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:58,197 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash 988012191, now seen corresponding path program 1 times [2019-09-10 07:31:58,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:58,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:58,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:58,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:58,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:58,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:58,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:58,605 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:31:58,605 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [117], [119], [122], [125], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [339], [344], [389], [390], [394], [395], [396] [2019-09-10 07:31:58,608 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:58,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:58,627 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:58,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:58,871 INFO L272 AbstractInterpreter]: Visited 101 different actions 563 times. Merged at 42 different actions 412 times. Widened at 14 different actions 73 times. Performed 1765 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1765 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 14 different actions. Largest state had 110 variables. [2019-09-10 07:31:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:58,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:58,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:58,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:58,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:58,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:31:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:59,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:31:59,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:59,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:59,438 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:59,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:59,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:59,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:59,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 37 [2019-09-10 07:31:59,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:59,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 07:31:59,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 07:31:59,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:31:59,939 INFO L87 Difference]: Start difference. First operand 89692 states and 112311 transitions. Second operand 27 states. [2019-09-10 07:32:02,906 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:32:03,213 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:32:03,839 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:32:05,769 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:32:06,296 WARN L188 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 07:32:06,939 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 07:32:09,565 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:32:09,718 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:32:10,927 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:32:11,107 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:32:14,813 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:32:16,821 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:32:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:32:18,129 INFO L93 Difference]: Finished difference Result 217507 states and 271454 transitions. [2019-09-10 07:32:18,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-10 07:32:18,130 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2019-09-10 07:32:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:32:20,312 INFO L225 Difference]: With dead ends: 217507 [2019-09-10 07:32:20,312 INFO L226 Difference]: Without dead ends: 217507 [2019-09-10 07:32:20,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9546 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=3878, Invalid=25534, Unknown=0, NotChecked=0, Total=29412 [2019-09-10 07:32:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217507 states. [2019-09-10 07:32:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217507 to 126180. [2019-09-10 07:32:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126180 states. [2019-09-10 07:32:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126180 states to 126180 states and 158090 transitions. [2019-09-10 07:32:21,683 INFO L78 Accepts]: Start accepts. Automaton has 126180 states and 158090 transitions. Word has length 107 [2019-09-10 07:32:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:32:21,684 INFO L475 AbstractCegarLoop]: Abstraction has 126180 states and 158090 transitions. [2019-09-10 07:32:21,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 07:32:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 126180 states and 158090 transitions. [2019-09-10 07:32:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:32:21,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:32:21,692 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-09-10 07:32:21,692 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:32:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1256248256, now seen corresponding path program 1 times [2019-09-10 07:32:21,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:32:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:21,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:21,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:32:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:22,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:32:22,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:32:22,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 07:32:22,060 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [63], [67], [70], [73], [75], [79], [82], [85], [87], [90], [94], [97], [100], [104], [107], [111], [114], [119], [122], [125], [128], [130], [133], [136], [139], [141], [144], [148], [151], [154], [158], [160], [163], [168], [171], [176], [178], [181], [184], [187], [189], [191], [194], [197], [202], [204], [207], [214], [216], [218], [221], [222], [224], [233], [236], [240], [242], [245], [251], [254], [257], [259], [276], [279], [282], [284], [292], [295], [301], [303], [306], [309], [311], [349], [354], [389], [390], [394], [395], [396] [2019-09-10 07:32:22,062 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:32:22,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:32:22,070 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:32:22,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:32:22,325 INFO L272 AbstractInterpreter]: Visited 101 different actions 494 times. Merged at 42 different actions 349 times. Widened at 13 different actions 52 times. Performed 1609 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1609 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 10 different actions. Largest state had 110 variables. [2019-09-10 07:32:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:22,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:32:22,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:32:22,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:32:22,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:22,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:32:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:22,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-10 07:32:22,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:32:23,834 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-10 07:32:24,065 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 07:32:24,541 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:32:24,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:25,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:25,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:25,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:25,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:31,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:32:32,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:33,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:33,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:33,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:33,813 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-09-10 07:32:34,576 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-09-10 07:32:35,088 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-09-10 07:32:36,008 WARN L188 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 119 [2019-09-10 07:32:36,631 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 07:32:37,534 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-09-10 07:32:37,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:37,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-10 07:32:37,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-10 07:32:37,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-10 07:32:37,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-10 07:32:39,476 WARN L188 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2019-09-10 07:32:40,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 07:32:40,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:40,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:40,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:40,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:40,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:40,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:32:42,540 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2019-09-10 07:32:43,471 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-09-10 07:32:43,937 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 71 [2019-09-10 07:32:44,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:32:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:45,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:32:45,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 33, 30] total 76 [2019-09-10 07:32:45,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:32:45,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 07:32:45,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 07:32:45,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=5307, Unknown=1, NotChecked=0, Total=5700 [2019-09-10 07:32:45,157 INFO L87 Difference]: Start difference. First operand 126180 states and 158090 transitions. Second operand 49 states. [2019-09-10 07:32:50,202 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:32:51,801 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:32:56,200 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:32:57,711 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:33:02,422 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 07:33:10,259 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:33:15,583 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-09-10 07:33:21,102 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-10 07:33:29,246 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 07:33:45,009 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-09-10 07:34:01,346 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-09-10 07:34:21,311 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2019-09-10 07:34:36,446 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2019-09-10 07:34:43,990 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 07:34:51,726 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 07:35:16,140 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2019-09-10 07:35:36,190 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 90 [2019-09-10 07:35:58,049 WARN L188 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2019-09-10 07:36:20,165 WARN L188 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 89 [2019-09-10 07:36:25,499 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 07:38:17,448 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2019-09-10 07:38:52,542 WARN L188 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 89 [2019-09-10 07:39:09,539 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-09-10 07:40:01,283 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 07:40:07,396 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:40:48,301 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:41:10,291 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 89 [2019-09-10 07:41:32,585 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 07:42:18,626 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 57 DAG size of output: 46