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-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:47:57,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:47:57,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:47:57,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:47:57,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:47:57,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:47:57,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:47:57,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:47:57,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:47:57,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:47:57,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:47:57,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:47:57,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:47:57,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:47:57,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:47:57,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:47:57,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:47:57,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:47:57,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:47:57,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:47:57,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:47:57,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:47:57,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:47:57,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:47:57,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:47:57,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:47:57,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:47:57,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:47:57,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:47:57,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:47:57,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:47:57,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:47:57,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:47:57,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:47:57,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:47:57,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:47:57,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:47:57,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:47:57,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:47:57,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:47:57,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:47:57,706 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 06:47:57,720 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:47:57,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:47:57,721 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:47:57,721 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:47:57,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:47:57,722 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:47:57,722 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:47:57,723 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:47:57,723 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:47:57,723 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:47:57,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:47:57,724 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:47:57,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:47:57,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:47:57,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:47:57,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:47:57,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:47:57,725 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:47:57,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:47:57,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:47:57,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:47:57,726 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:47:57,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:47:57,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:47:57,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:47:57,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:47:57,727 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:47:57,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:47:57,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:47:57,728 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:47:57,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:47:57,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:47:57,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:47:57,772 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:47:57,772 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:47:57,773 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:47:57,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4810bcbba/a354d86e9def436b969e8da5d626cd27/FLAG8a9bcd2df [2019-09-10 06:47:58,490 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:47:58,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:47:58,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4810bcbba/a354d86e9def436b969e8da5d626cd27/FLAG8a9bcd2df [2019-09-10 06:47:58,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4810bcbba/a354d86e9def436b969e8da5d626cd27 [2019-09-10 06:47:58,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:47:58,663 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:47:58,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:47:58,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:47:58,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:47:58,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:47:58" (1/1) ... [2019-09-10 06:47:58,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f35a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:58, skipping insertion in model container [2019-09-10 06:47:58,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:47:58" (1/1) ... [2019-09-10 06:47:58,681 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:47:58,856 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:47:59,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:47:59,861 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:48:00,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:48:00,162 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:48:00,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:00 WrapperNode [2019-09-10 06:48:00,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:48:00,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:48:00,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:48:00,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:48:00,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:00" (1/1) ... [2019-09-10 06:48:00,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:00" (1/1) ... [2019-09-10 06:48:00,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:00" (1/1) ... [2019-09-10 06:48:00,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:00" (1/1) ... [2019-09-10 06:48:00,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:00" (1/1) ... [2019-09-10 06:48:00,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:00" (1/1) ... [2019-09-10 06:48:00,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:00" (1/1) ... [2019-09-10 06:48:00,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:48:00,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:48:00,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:48:00,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:48:00,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:00" (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 06:48:00,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:48:00,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:48:00,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:48:00,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:48:00,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:48:00,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:48:00,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:48:00,446 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:48:00,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:48:00,446 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:48:00,446 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:48:00,446 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:48:00,447 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:48:00,447 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:48:00,447 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:48:00,447 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:48:00,447 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:48:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:48:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:48:03,701 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:48:03,702 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:48:03,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:48:03 BoogieIcfgContainer [2019-09-10 06:48:03,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:48:03,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:48:03,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:48:03,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:48:03,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:47:58" (1/3) ... [2019-09-10 06:48:03,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4767b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:48:03, skipping insertion in model container [2019-09-10 06:48:03,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:48:00" (2/3) ... [2019-09-10 06:48:03,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4767b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:48:03, skipping insertion in model container [2019-09-10 06:48:03,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:48:03" (3/3) ... [2019-09-10 06:48:03,717 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 06:48:03,727 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:48:03,754 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-10 06:48:03,770 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-10 06:48:03,797 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:48:03,797 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:48:03,797 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:48:03,797 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:48:03,797 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:48:03,797 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:48:03,798 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:48:03,798 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:48:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-09-10 06:48:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:48:03,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:03,863 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 06:48:03,866 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-09-10 06:48:03,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:03,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:03,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:03,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:04,419 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 06:48:04,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:04,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:04,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:04,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:04,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:04,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:04,446 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-09-10 06:48:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:06,587 INFO L93 Difference]: Finished difference Result 1566 states and 2684 transitions. [2019-09-10 06:48:06,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:06,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-10 06:48:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:06,616 INFO L225 Difference]: With dead ends: 1566 [2019-09-10 06:48:06,616 INFO L226 Difference]: Without dead ends: 1554 [2019-09-10 06:48:06,618 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 06:48:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-09-10 06:48:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1548. [2019-09-10 06:48:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-09-10 06:48:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2090 transitions. [2019-09-10 06:48:06,749 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2090 transitions. Word has length 55 [2019-09-10 06:48:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:06,750 INFO L475 AbstractCegarLoop]: Abstraction has 1548 states and 2090 transitions. [2019-09-10 06:48:06,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2090 transitions. [2019-09-10 06:48:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:48:06,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:06,756 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 06:48:06,757 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:06,757 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-09-10 06:48:06,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:06,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:06,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:06,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:06,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:07,044 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 06:48:07,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:07,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:07,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:07,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:07,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:07,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:07,047 INFO L87 Difference]: Start difference. First operand 1548 states and 2090 transitions. Second operand 6 states. [2019-09-10 06:48:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:08,273 INFO L93 Difference]: Finished difference Result 2296 states and 3137 transitions. [2019-09-10 06:48:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:08,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:48:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:08,288 INFO L225 Difference]: With dead ends: 2296 [2019-09-10 06:48:08,289 INFO L226 Difference]: Without dead ends: 2296 [2019-09-10 06:48:08,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:48:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-09-10 06:48:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2280. [2019-09-10 06:48:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-09-10 06:48:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3126 transitions. [2019-09-10 06:48:08,365 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3126 transitions. Word has length 56 [2019-09-10 06:48:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:08,366 INFO L475 AbstractCegarLoop]: Abstraction has 2280 states and 3126 transitions. [2019-09-10 06:48:08,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3126 transitions. [2019-09-10 06:48:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:48:08,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:08,372 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 06:48:08,373 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-09-10 06:48:08,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:08,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:08,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:08,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:08,572 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 06:48:08,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:08,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:08,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:08,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:08,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:08,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:08,575 INFO L87 Difference]: Start difference. First operand 2280 states and 3126 transitions. Second operand 6 states. [2019-09-10 06:48:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:10,053 INFO L93 Difference]: Finished difference Result 4335 states and 5986 transitions. [2019-09-10 06:48:10,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:10,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:48:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:10,078 INFO L225 Difference]: With dead ends: 4335 [2019-09-10 06:48:10,078 INFO L226 Difference]: Without dead ends: 4335 [2019-09-10 06:48:10,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:48:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2019-09-10 06:48:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4315. [2019-09-10 06:48:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-09-10 06:48:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5971 transitions. [2019-09-10 06:48:10,183 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5971 transitions. Word has length 56 [2019-09-10 06:48:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:10,185 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5971 transitions. [2019-09-10 06:48:10,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5971 transitions. [2019-09-10 06:48:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:48:10,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:10,190 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 06:48:10,190 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:10,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:10,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-09-10 06:48:10,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:10,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:10,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:10,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:10,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:10,440 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 06:48:10,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:10,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:48:10,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:10,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:48:10,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:48:10,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:10,442 INFO L87 Difference]: Start difference. First operand 4315 states and 5971 transitions. Second operand 9 states. [2019-09-10 06:48:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:13,544 INFO L93 Difference]: Finished difference Result 9697 states and 14267 transitions. [2019-09-10 06:48:13,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:48:13,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-10 06:48:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:13,594 INFO L225 Difference]: With dead ends: 9697 [2019-09-10 06:48:13,595 INFO L226 Difference]: Without dead ends: 9697 [2019-09-10 06:48:13,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:48:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9697 states. [2019-09-10 06:48:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9697 to 4315. [2019-09-10 06:48:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-09-10 06:48:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5970 transitions. [2019-09-10 06:48:13,828 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5970 transitions. Word has length 57 [2019-09-10 06:48:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:13,829 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5970 transitions. [2019-09-10 06:48:13,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:48:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5970 transitions. [2019-09-10 06:48:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:48:13,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:13,835 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 06:48:13,835 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:13,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-09-10 06:48:13,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:13,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:13,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:13,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:14,016 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 06:48:14,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:14,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:48:14,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:14,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:48:14,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:48:14,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:14,018 INFO L87 Difference]: Start difference. First operand 4315 states and 5970 transitions. Second operand 9 states. [2019-09-10 06:48:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:18,255 INFO L93 Difference]: Finished difference Result 11066 states and 15933 transitions. [2019-09-10 06:48:18,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:48:18,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-10 06:48:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:18,308 INFO L225 Difference]: With dead ends: 11066 [2019-09-10 06:48:18,308 INFO L226 Difference]: Without dead ends: 11066 [2019-09-10 06:48:18,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:48:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-09-10 06:48:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4315. [2019-09-10 06:48:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-09-10 06:48:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5969 transitions. [2019-09-10 06:48:18,475 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5969 transitions. Word has length 57 [2019-09-10 06:48:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:18,475 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5969 transitions. [2019-09-10 06:48:18,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:48:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5969 transitions. [2019-09-10 06:48:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:48:18,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:18,480 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 06:48:18,481 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-09-10 06:48:18,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:18,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:18,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:18,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:18,644 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 06:48:18,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:18,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:48:18,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:18,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:48:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:48:18,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:48:18,646 INFO L87 Difference]: Start difference. First operand 4315 states and 5969 transitions. Second operand 8 states. [2019-09-10 06:48:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:20,977 INFO L93 Difference]: Finished difference Result 9416 states and 13958 transitions. [2019-09-10 06:48:20,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:48:20,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-09-10 06:48:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:20,998 INFO L225 Difference]: With dead ends: 9416 [2019-09-10 06:48:20,999 INFO L226 Difference]: Without dead ends: 9416 [2019-09-10 06:48:20,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:48:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2019-09-10 06:48:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 4315. [2019-09-10 06:48:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-09-10 06:48:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5968 transitions. [2019-09-10 06:48:21,105 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5968 transitions. Word has length 57 [2019-09-10 06:48:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:21,106 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5968 transitions. [2019-09-10 06:48:21,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:48:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5968 transitions. [2019-09-10 06:48:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:48:21,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:21,111 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 06:48:21,111 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:21,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:21,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-09-10 06:48:21,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:21,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:21,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:21,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:21,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:21,181 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 06:48:21,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:21,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:21,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:21,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:21,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:21,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:21,183 INFO L87 Difference]: Start difference. First operand 4315 states and 5968 transitions. Second operand 3 states. [2019-09-10 06:48:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:21,328 INFO L93 Difference]: Finished difference Result 5459 states and 7529 transitions. [2019-09-10 06:48:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:21,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:48:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:21,341 INFO L225 Difference]: With dead ends: 5459 [2019-09-10 06:48:21,341 INFO L226 Difference]: Without dead ends: 5459 [2019-09-10 06:48:21,342 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 06:48:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5459 states. [2019-09-10 06:48:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5459 to 5453. [2019-09-10 06:48:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-09-10 06:48:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 7525 transitions. [2019-09-10 06:48:21,425 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 7525 transitions. Word has length 58 [2019-09-10 06:48:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:21,426 INFO L475 AbstractCegarLoop]: Abstraction has 5453 states and 7525 transitions. [2019-09-10 06:48:21,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 7525 transitions. [2019-09-10 06:48:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:48:21,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:21,432 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 06:48:21,432 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:21,433 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-09-10 06:48:21,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:21,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:21,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:21,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:21,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:21,519 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 06:48:21,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:21,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:21,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:21,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:21,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:21,521 INFO L87 Difference]: Start difference. First operand 5453 states and 7525 transitions. Second operand 3 states. [2019-09-10 06:48:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:21,603 INFO L93 Difference]: Finished difference Result 6617 states and 9342 transitions. [2019-09-10 06:48:21,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:21,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:48:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:21,617 INFO L225 Difference]: With dead ends: 6617 [2019-09-10 06:48:21,617 INFO L226 Difference]: Without dead ends: 6617 [2019-09-10 06:48:21,618 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 06:48:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2019-09-10 06:48:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6025. [2019-09-10 06:48:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6025 states. [2019-09-10 06:48:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8443 transitions. [2019-09-10 06:48:21,763 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8443 transitions. Word has length 58 [2019-09-10 06:48:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:21,764 INFO L475 AbstractCegarLoop]: Abstraction has 6025 states and 8443 transitions. [2019-09-10 06:48:21,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8443 transitions. [2019-09-10 06:48:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:48:21,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:21,769 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 06:48:21,769 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:21,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-09-10 06:48:21,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:21,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:21,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:21,838 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 06:48:21,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:21,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:21,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:21,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:21,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:21,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:21,840 INFO L87 Difference]: Start difference. First operand 6025 states and 8443 transitions. Second operand 3 states. [2019-09-10 06:48:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:21,940 INFO L93 Difference]: Finished difference Result 8007 states and 11370 transitions. [2019-09-10 06:48:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:21,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:48:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:21,956 INFO L225 Difference]: With dead ends: 8007 [2019-09-10 06:48:21,956 INFO L226 Difference]: Without dead ends: 8007 [2019-09-10 06:48:21,957 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 06:48:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8007 states. [2019-09-10 06:48:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8007 to 7105. [2019-09-10 06:48:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-09-10 06:48:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 10025 transitions. [2019-09-10 06:48:22,065 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 10025 transitions. Word has length 58 [2019-09-10 06:48:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:22,066 INFO L475 AbstractCegarLoop]: Abstraction has 7105 states and 10025 transitions. [2019-09-10 06:48:22,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 10025 transitions. [2019-09-10 06:48:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:48:22,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:22,075 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 06:48:22,075 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-09-10 06:48:22,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:22,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:22,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:22,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:22,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:22,151 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 06:48:22,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:22,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:22,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:22,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:22,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:22,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:22,156 INFO L87 Difference]: Start difference. First operand 7105 states and 10025 transitions. Second operand 3 states. [2019-09-10 06:48:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:22,454 INFO L93 Difference]: Finished difference Result 7194 states and 10208 transitions. [2019-09-10 06:48:22,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:22,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:48:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:22,478 INFO L225 Difference]: With dead ends: 7194 [2019-09-10 06:48:22,479 INFO L226 Difference]: Without dead ends: 7194 [2019-09-10 06:48:22,480 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 06:48:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-09-10 06:48:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 5653. [2019-09-10 06:48:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2019-09-10 06:48:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 8055 transitions. [2019-09-10 06:48:22,577 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 8055 transitions. Word has length 59 [2019-09-10 06:48:22,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:22,577 INFO L475 AbstractCegarLoop]: Abstraction has 5653 states and 8055 transitions. [2019-09-10 06:48:22,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 8055 transitions. [2019-09-10 06:48:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:48:22,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:22,584 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 06:48:22,584 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:22,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:22,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1119557590, now seen corresponding path program 1 times [2019-09-10 06:48:22,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:22,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:22,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:22,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:22,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:22,669 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 06:48:22,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:22,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:22,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:22,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:22,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:22,671 INFO L87 Difference]: Start difference. First operand 5653 states and 8055 transitions. Second operand 3 states. [2019-09-10 06:48:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:22,818 INFO L93 Difference]: Finished difference Result 8449 states and 12356 transitions. [2019-09-10 06:48:22,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:22,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:48:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:22,835 INFO L225 Difference]: With dead ends: 8449 [2019-09-10 06:48:22,835 INFO L226 Difference]: Without dead ends: 8449 [2019-09-10 06:48:22,837 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 06:48:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-09-10 06:48:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 6679. [2019-09-10 06:48:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6679 states. [2019-09-10 06:48:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 9719 transitions. [2019-09-10 06:48:22,942 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 9719 transitions. Word has length 59 [2019-09-10 06:48:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:22,942 INFO L475 AbstractCegarLoop]: Abstraction has 6679 states and 9719 transitions. [2019-09-10 06:48:22,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 9719 transitions. [2019-09-10 06:48:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:48:22,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:22,945 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 06:48:22,946 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash 926744535, now seen corresponding path program 1 times [2019-09-10 06:48:22,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:22,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:22,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:23,031 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 06:48:23,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:23,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:23,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:23,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:23,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:23,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:23,034 INFO L87 Difference]: Start difference. First operand 6679 states and 9719 transitions. Second operand 3 states. [2019-09-10 06:48:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:23,171 INFO L93 Difference]: Finished difference Result 10816 states and 15983 transitions. [2019-09-10 06:48:23,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:23,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:48:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:23,199 INFO L225 Difference]: With dead ends: 10816 [2019-09-10 06:48:23,199 INFO L226 Difference]: Without dead ends: 10816 [2019-09-10 06:48:23,200 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 06:48:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2019-09-10 06:48:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 8416. [2019-09-10 06:48:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8416 states. [2019-09-10 06:48:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 12405 transitions. [2019-09-10 06:48:23,353 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 12405 transitions. Word has length 59 [2019-09-10 06:48:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:23,353 INFO L475 AbstractCegarLoop]: Abstraction has 8416 states and 12405 transitions. [2019-09-10 06:48:23,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 12405 transitions. [2019-09-10 06:48:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:48:23,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:23,356 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 06:48:23,356 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:23,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:23,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1408819210, now seen corresponding path program 1 times [2019-09-10 06:48:23,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:23,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:23,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:23,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:23,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:24,129 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 06:48:24,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:24,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:48:24,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:24,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:48:24,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:48:24,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:48:24,132 INFO L87 Difference]: Start difference. First operand 8416 states and 12405 transitions. Second operand 13 states. [2019-09-10 06:48:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:26,366 INFO L93 Difference]: Finished difference Result 12679 states and 18688 transitions. [2019-09-10 06:48:26,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:48:26,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-10 06:48:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:26,403 INFO L225 Difference]: With dead ends: 12679 [2019-09-10 06:48:26,403 INFO L226 Difference]: Without dead ends: 12679 [2019-09-10 06:48:26,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:48:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12679 states. [2019-09-10 06:48:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12679 to 8412. [2019-09-10 06:48:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8412 states. [2019-09-10 06:48:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8412 states to 8412 states and 12401 transitions. [2019-09-10 06:48:26,574 INFO L78 Accepts]: Start accepts. Automaton has 8412 states and 12401 transitions. Word has length 60 [2019-09-10 06:48:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:26,575 INFO L475 AbstractCegarLoop]: Abstraction has 8412 states and 12401 transitions. [2019-09-10 06:48:26,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:48:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 8412 states and 12401 transitions. [2019-09-10 06:48:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:48:26,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:26,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] [2019-09-10 06:48:26,580 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:26,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1965728590, now seen corresponding path program 1 times [2019-09-10 06:48:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:26,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:27,242 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 06:48:27,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:27,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:48:27,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:27,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:48:27,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:48:27,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:48:27,244 INFO L87 Difference]: Start difference. First operand 8412 states and 12401 transitions. Second operand 14 states. [2019-09-10 06:48:27,872 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 06:48:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:30,271 INFO L93 Difference]: Finished difference Result 18466 states and 27258 transitions. [2019-09-10 06:48:30,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:48:30,272 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-09-10 06:48:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:30,310 INFO L225 Difference]: With dead ends: 18466 [2019-09-10 06:48:30,311 INFO L226 Difference]: Without dead ends: 18466 [2019-09-10 06:48:30,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:48:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18466 states. [2019-09-10 06:48:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18466 to 8355. [2019-09-10 06:48:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8355 states. [2019-09-10 06:48:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8355 states to 8355 states and 12326 transitions. [2019-09-10 06:48:30,494 INFO L78 Accepts]: Start accepts. Automaton has 8355 states and 12326 transitions. Word has length 60 [2019-09-10 06:48:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:30,494 INFO L475 AbstractCegarLoop]: Abstraction has 8355 states and 12326 transitions. [2019-09-10 06:48:30,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:48:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8355 states and 12326 transitions. [2019-09-10 06:48:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:48:30,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:30,497 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 06:48:30,497 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1190610116, now seen corresponding path program 1 times [2019-09-10 06:48:30,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:30,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:30,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:30,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:30,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:30,915 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 06:48:30,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:30,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:48:30,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:30,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:48:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:48:30,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:48:30,917 INFO L87 Difference]: Start difference. First operand 8355 states and 12326 transitions. Second operand 11 states. [2019-09-10 06:48:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:32,502 INFO L93 Difference]: Finished difference Result 17922 states and 26601 transitions. [2019-09-10 06:48:32,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:48:32,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-09-10 06:48:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:32,536 INFO L225 Difference]: With dead ends: 17922 [2019-09-10 06:48:32,536 INFO L226 Difference]: Without dead ends: 17922 [2019-09-10 06:48:32,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:48:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17922 states. [2019-09-10 06:48:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17922 to 8351. [2019-09-10 06:48:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8351 states. [2019-09-10 06:48:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8351 states to 8351 states and 12322 transitions. [2019-09-10 06:48:32,690 INFO L78 Accepts]: Start accepts. Automaton has 8351 states and 12322 transitions. Word has length 61 [2019-09-10 06:48:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:32,691 INFO L475 AbstractCegarLoop]: Abstraction has 8351 states and 12322 transitions. [2019-09-10 06:48:32,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:48:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 8351 states and 12322 transitions. [2019-09-10 06:48:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:48:32,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:32,694 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] [2019-09-10 06:48:32,694 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:32,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:32,695 INFO L82 PathProgramCache]: Analyzing trace with hash 624248826, now seen corresponding path program 1 times [2019-09-10 06:48:32,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:32,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:32,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:32,786 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 06:48:32,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:32,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:32,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:32,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:32,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:32,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:32,789 INFO L87 Difference]: Start difference. First operand 8351 states and 12322 transitions. Second operand 6 states. [2019-09-10 06:48:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:33,032 INFO L93 Difference]: Finished difference Result 29296 states and 42313 transitions. [2019-09-10 06:48:33,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:48:33,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-10 06:48:33,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:33,080 INFO L225 Difference]: With dead ends: 29296 [2019-09-10 06:48:33,080 INFO L226 Difference]: Without dead ends: 29296 [2019-09-10 06:48:33,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:48:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29296 states. [2019-09-10 06:48:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29296 to 25708. [2019-09-10 06:48:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25708 states. [2019-09-10 06:48:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25708 states to 25708 states and 37186 transitions. [2019-09-10 06:48:33,402 INFO L78 Accepts]: Start accepts. Automaton has 25708 states and 37186 transitions. Word has length 67 [2019-09-10 06:48:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:33,402 INFO L475 AbstractCegarLoop]: Abstraction has 25708 states and 37186 transitions. [2019-09-10 06:48:33,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 25708 states and 37186 transitions. [2019-09-10 06:48:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:48:33,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:33,406 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] [2019-09-10 06:48:33,407 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:33,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:33,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1849830759, now seen corresponding path program 1 times [2019-09-10 06:48:33,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:33,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:33,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:33,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:33,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:33,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 06:48:33,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:33,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:33,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:33,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:33,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:33,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:33,520 INFO L87 Difference]: Start difference. First operand 25708 states and 37186 transitions. Second operand 5 states. [2019-09-10 06:48:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:33,691 INFO L93 Difference]: Finished difference Result 22073 states and 31517 transitions. [2019-09-10 06:48:33,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:33,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 06:48:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:33,740 INFO L225 Difference]: With dead ends: 22073 [2019-09-10 06:48:33,740 INFO L226 Difference]: Without dead ends: 22073 [2019-09-10 06:48:33,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 06:48:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22073 states. [2019-09-10 06:48:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22073 to 19484. [2019-09-10 06:48:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19484 states. [2019-09-10 06:48:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19484 states to 19484 states and 27846 transitions. [2019-09-10 06:48:34,697 INFO L78 Accepts]: Start accepts. Automaton has 19484 states and 27846 transitions. Word has length 68 [2019-09-10 06:48:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:34,697 INFO L475 AbstractCegarLoop]: Abstraction has 19484 states and 27846 transitions. [2019-09-10 06:48:34,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 19484 states and 27846 transitions. [2019-09-10 06:48:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:48:34,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:34,702 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] [2019-09-10 06:48:34,703 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:34,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:34,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1871092716, now seen corresponding path program 1 times [2019-09-10 06:48:34,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:34,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:34,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:34,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:34,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:34,803 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 06:48:34,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:34,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:34,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:34,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:34,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:34,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:34,804 INFO L87 Difference]: Start difference. First operand 19484 states and 27846 transitions. Second operand 6 states. [2019-09-10 06:48:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:34,986 INFO L93 Difference]: Finished difference Result 33784 states and 47292 transitions. [2019-09-10 06:48:34,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:48:34,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:48:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:35,034 INFO L225 Difference]: With dead ends: 33784 [2019-09-10 06:48:35,035 INFO L226 Difference]: Without dead ends: 33784 [2019-09-10 06:48:35,035 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 06:48:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33784 states. [2019-09-10 06:48:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33784 to 20126. [2019-09-10 06:48:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20126 states. [2019-09-10 06:48:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20126 states to 20126 states and 28339 transitions. [2019-09-10 06:48:35,391 INFO L78 Accepts]: Start accepts. Automaton has 20126 states and 28339 transitions. Word has length 70 [2019-09-10 06:48:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:35,392 INFO L475 AbstractCegarLoop]: Abstraction has 20126 states and 28339 transitions. [2019-09-10 06:48:35,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 20126 states and 28339 transitions. [2019-09-10 06:48:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:48:35,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:35,398 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] [2019-09-10 06:48:35,399 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2055411099, now seen corresponding path program 1 times [2019-09-10 06:48:35,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:35,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:35,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:35,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:35,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:35,460 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 06:48:35,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:35,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:35,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:35,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:35,461 INFO L87 Difference]: Start difference. First operand 20126 states and 28339 transitions. Second operand 3 states. [2019-09-10 06:48:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:35,602 INFO L93 Difference]: Finished difference Result 35124 states and 48670 transitions. [2019-09-10 06:48:35,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:35,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-10 06:48:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:35,635 INFO L225 Difference]: With dead ends: 35124 [2019-09-10 06:48:35,636 INFO L226 Difference]: Without dead ends: 35124 [2019-09-10 06:48:35,636 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 06:48:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35124 states. [2019-09-10 06:48:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35124 to 34658. [2019-09-10 06:48:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34658 states. [2019-09-10 06:48:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34658 states to 34658 states and 48205 transitions. [2019-09-10 06:48:36,187 INFO L78 Accepts]: Start accepts. Automaton has 34658 states and 48205 transitions. Word has length 71 [2019-09-10 06:48:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:36,187 INFO L475 AbstractCegarLoop]: Abstraction has 34658 states and 48205 transitions. [2019-09-10 06:48:36,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 34658 states and 48205 transitions. [2019-09-10 06:48:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:48:36,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:36,195 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] [2019-09-10 06:48:36,195 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:36,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1175358734, now seen corresponding path program 1 times [2019-09-10 06:48:36,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:36,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:36,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:36,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:36,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:36,264 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 06:48:36,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:36,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:36,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:36,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:36,266 INFO L87 Difference]: Start difference. First operand 34658 states and 48205 transitions. Second operand 3 states. [2019-09-10 06:48:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:36,374 INFO L93 Difference]: Finished difference Result 34643 states and 47814 transitions. [2019-09-10 06:48:36,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:36,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 06:48:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:36,408 INFO L225 Difference]: With dead ends: 34643 [2019-09-10 06:48:36,409 INFO L226 Difference]: Without dead ends: 34643 [2019-09-10 06:48:36,409 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 06:48:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34643 states. [2019-09-10 06:48:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34643 to 29491. [2019-09-10 06:48:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29491 states. [2019-09-10 06:48:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29491 states to 29491 states and 40824 transitions. [2019-09-10 06:48:36,724 INFO L78 Accepts]: Start accepts. Automaton has 29491 states and 40824 transitions. Word has length 72 [2019-09-10 06:48:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:36,724 INFO L475 AbstractCegarLoop]: Abstraction has 29491 states and 40824 transitions. [2019-09-10 06:48:36,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 29491 states and 40824 transitions. [2019-09-10 06:48:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:48:36,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:36,728 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] [2019-09-10 06:48:36,728 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash 353507174, now seen corresponding path program 1 times [2019-09-10 06:48:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:36,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:36,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:36,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:36,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:36,802 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 06:48:36,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:36,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:36,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:36,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:36,804 INFO L87 Difference]: Start difference. First operand 29491 states and 40824 transitions. Second operand 5 states. [2019-09-10 06:48:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:37,608 INFO L93 Difference]: Finished difference Result 92094 states and 124517 transitions. [2019-09-10 06:48:37,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:48:37,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-10 06:48:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:37,697 INFO L225 Difference]: With dead ends: 92094 [2019-09-10 06:48:37,698 INFO L226 Difference]: Without dead ends: 92094 [2019-09-10 06:48:37,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92094 states. [2019-09-10 06:48:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92094 to 48003. [2019-09-10 06:48:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48003 states. [2019-09-10 06:48:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48003 states to 48003 states and 65438 transitions. [2019-09-10 06:48:39,360 INFO L78 Accepts]: Start accepts. Automaton has 48003 states and 65438 transitions. Word has length 74 [2019-09-10 06:48:39,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:39,360 INFO L475 AbstractCegarLoop]: Abstraction has 48003 states and 65438 transitions. [2019-09-10 06:48:39,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 48003 states and 65438 transitions. [2019-09-10 06:48:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:48:39,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:39,364 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] [2019-09-10 06:48:39,364 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2143339772, now seen corresponding path program 1 times [2019-09-10 06:48:39,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:39,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:39,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:39,437 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 06:48:39,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:39,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:39,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:39,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:39,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:39,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:39,440 INFO L87 Difference]: Start difference. First operand 48003 states and 65438 transitions. Second operand 5 states. [2019-09-10 06:48:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:40,291 INFO L93 Difference]: Finished difference Result 145806 states and 195005 transitions. [2019-09-10 06:48:40,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:48:40,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 06:48:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:40,464 INFO L225 Difference]: With dead ends: 145806 [2019-09-10 06:48:40,464 INFO L226 Difference]: Without dead ends: 145806 [2019-09-10 06:48:40,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145806 states. [2019-09-10 06:48:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145806 to 94964. [2019-09-10 06:48:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94964 states. [2019-09-10 06:48:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94964 states to 94964 states and 128949 transitions. [2019-09-10 06:48:44,264 INFO L78 Accepts]: Start accepts. Automaton has 94964 states and 128949 transitions. Word has length 77 [2019-09-10 06:48:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:44,264 INFO L475 AbstractCegarLoop]: Abstraction has 94964 states and 128949 transitions. [2019-09-10 06:48:44,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 94964 states and 128949 transitions. [2019-09-10 06:48:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:48:44,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:44,269 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 06:48:44,269 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:44,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:44,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1797768461, now seen corresponding path program 1 times [2019-09-10 06:48:44,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:44,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:44,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:44,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:44,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:44,389 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 06:48:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:44,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:44,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:44,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:44,392 INFO L87 Difference]: Start difference. First operand 94964 states and 128949 transitions. Second operand 6 states. [2019-09-10 06:48:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:44,759 INFO L93 Difference]: Finished difference Result 121646 states and 164633 transitions. [2019-09-10 06:48:44,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:48:44,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-09-10 06:48:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:44,881 INFO L225 Difference]: With dead ends: 121646 [2019-09-10 06:48:44,881 INFO L226 Difference]: Without dead ends: 121646 [2019-09-10 06:48:44,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121646 states. [2019-09-10 06:48:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121646 to 111168. [2019-09-10 06:48:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111168 states. [2019-09-10 06:48:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111168 states to 111168 states and 150647 transitions. [2019-09-10 06:48:46,332 INFO L78 Accepts]: Start accepts. Automaton has 111168 states and 150647 transitions. Word has length 79 [2019-09-10 06:48:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:46,333 INFO L475 AbstractCegarLoop]: Abstraction has 111168 states and 150647 transitions. [2019-09-10 06:48:46,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 111168 states and 150647 transitions. [2019-09-10 06:48:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:48:46,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:46,338 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 06:48:46,338 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:46,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:46,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1867381610, now seen corresponding path program 1 times [2019-09-10 06:48:46,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:46,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:46,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:46,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:46,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:46,411 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 06:48:46,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:46,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:46,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:46,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:46,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:46,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:46,413 INFO L87 Difference]: Start difference. First operand 111168 states and 150647 transitions. Second operand 3 states. [2019-09-10 06:48:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:46,790 INFO L93 Difference]: Finished difference Result 107578 states and 142334 transitions. [2019-09-10 06:48:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:46,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 06:48:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:46,955 INFO L225 Difference]: With dead ends: 107578 [2019-09-10 06:48:46,955 INFO L226 Difference]: Without dead ends: 107578 [2019-09-10 06:48:46,956 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 06:48:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107578 states. [2019-09-10 06:48:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107578 to 88329. [2019-09-10 06:48:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88329 states. [2019-09-10 06:48:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88329 states to 88329 states and 117161 transitions. [2019-09-10 06:48:48,813 INFO L78 Accepts]: Start accepts. Automaton has 88329 states and 117161 transitions. Word has length 79 [2019-09-10 06:48:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:48,814 INFO L475 AbstractCegarLoop]: Abstraction has 88329 states and 117161 transitions. [2019-09-10 06:48:48,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 88329 states and 117161 transitions. [2019-09-10 06:48:48,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:48:48,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:48,818 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 06:48:48,818 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:48,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash 874030055, now seen corresponding path program 1 times [2019-09-10 06:48:48,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:48,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:48,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:48,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:48,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:48,882 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 06:48:48,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:48,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:48,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:48,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:48,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:48,883 INFO L87 Difference]: Start difference. First operand 88329 states and 117161 transitions. Second operand 3 states. [2019-09-10 06:48:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:49,235 INFO L93 Difference]: Finished difference Result 103097 states and 134619 transitions. [2019-09-10 06:48:49,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:49,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:48:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:49,396 INFO L225 Difference]: With dead ends: 103097 [2019-09-10 06:48:49,397 INFO L226 Difference]: Without dead ends: 103097 [2019-09-10 06:48:49,397 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 06:48:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103097 states. [2019-09-10 06:48:53,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103097 to 98394. [2019-09-10 06:48:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98394 states. [2019-09-10 06:48:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98394 states to 98394 states and 129185 transitions. [2019-09-10 06:48:53,113 INFO L78 Accepts]: Start accepts. Automaton has 98394 states and 129185 transitions. Word has length 82 [2019-09-10 06:48:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:53,113 INFO L475 AbstractCegarLoop]: Abstraction has 98394 states and 129185 transitions. [2019-09-10 06:48:53,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 98394 states and 129185 transitions. [2019-09-10 06:48:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 06:48:53,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:53,121 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:48:53,121 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1798700343, now seen corresponding path program 1 times [2019-09-10 06:48:53,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:53,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:53,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:53,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:53,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:53,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:53,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:53,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:53,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:53,192 INFO L87 Difference]: Start difference. First operand 98394 states and 129185 transitions. Second operand 3 states. [2019-09-10 06:48:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:53,580 INFO L93 Difference]: Finished difference Result 176422 states and 225552 transitions. [2019-09-10 06:48:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:53,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 06:48:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:53,759 INFO L225 Difference]: With dead ends: 176422 [2019-09-10 06:48:53,759 INFO L226 Difference]: Without dead ends: 176422 [2019-09-10 06:48:53,759 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 06:48:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176422 states. [2019-09-10 06:48:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176422 to 155281. [2019-09-10 06:48:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155281 states. [2019-09-10 06:48:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155281 states to 155281 states and 200125 transitions. [2019-09-10 06:48:55,493 INFO L78 Accepts]: Start accepts. Automaton has 155281 states and 200125 transitions. Word has length 90 [2019-09-10 06:48:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:55,494 INFO L475 AbstractCegarLoop]: Abstraction has 155281 states and 200125 transitions. [2019-09-10 06:48:55,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 155281 states and 200125 transitions. [2019-09-10 06:48:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:48:55,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:55,503 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:48:55,503 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:55,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:55,504 INFO L82 PathProgramCache]: Analyzing trace with hash 25741144, now seen corresponding path program 1 times [2019-09-10 06:48:55,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:55,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:55,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:48:55,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:55,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:48:55,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:55,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:48:55,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:48:55,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:55,654 INFO L87 Difference]: Start difference. First operand 155281 states and 200125 transitions. Second operand 9 states. [2019-09-10 06:48:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:58,944 INFO L93 Difference]: Finished difference Result 383010 states and 492562 transitions. [2019-09-10 06:48:58,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:48:58,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 06:48:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:59,375 INFO L225 Difference]: With dead ends: 383010 [2019-09-10 06:48:59,375 INFO L226 Difference]: Without dead ends: 383010 [2019-09-10 06:48:59,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:48:59,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383010 states. [2019-09-10 06:49:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383010 to 155266. [2019-09-10 06:49:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155266 states. [2019-09-10 06:49:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155266 states to 155266 states and 200109 transitions. [2019-09-10 06:49:05,504 INFO L78 Accepts]: Start accepts. Automaton has 155266 states and 200109 transitions. Word has length 92 [2019-09-10 06:49:05,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:05,504 INFO L475 AbstractCegarLoop]: Abstraction has 155266 states and 200109 transitions. [2019-09-10 06:49:05,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:49:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 155266 states and 200109 transitions. [2019-09-10 06:49:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:49:05,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:05,513 INFO L399 BasicCegarLoop]: trace histogram [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 06:49:05,513 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:05,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:05,514 INFO L82 PathProgramCache]: Analyzing trace with hash -978519268, now seen corresponding path program 1 times [2019-09-10 06:49:05,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:05,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:05,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:05,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:05,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:05,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:05,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:49:05,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:05,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:49:05,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:49:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:49:05,703 INFO L87 Difference]: Start difference. First operand 155266 states and 200109 transitions. Second operand 10 states. [2019-09-10 06:49:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:09,773 INFO L93 Difference]: Finished difference Result 523916 states and 670518 transitions. [2019-09-10 06:49:09,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:49:09,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-09-10 06:49:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:10,522 INFO L225 Difference]: With dead ends: 523916 [2019-09-10 06:49:10,522 INFO L226 Difference]: Without dead ends: 523916 [2019-09-10 06:49:10,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:49:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523916 states. [2019-09-10 06:49:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523916 to 251228. [2019-09-10 06:49:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251228 states. [2019-09-10 06:49:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251228 states to 251228 states and 323622 transitions. [2019-09-10 06:49:19,357 INFO L78 Accepts]: Start accepts. Automaton has 251228 states and 323622 transitions. Word has length 93 [2019-09-10 06:49:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:19,357 INFO L475 AbstractCegarLoop]: Abstraction has 251228 states and 323622 transitions. [2019-09-10 06:49:19,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:49:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 251228 states and 323622 transitions. [2019-09-10 06:49:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:49:19,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:19,368 INFO L399 BasicCegarLoop]: trace histogram [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 06:49:19,369 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:19,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:19,369 INFO L82 PathProgramCache]: Analyzing trace with hash -287132240, now seen corresponding path program 1 times [2019-09-10 06:49:19,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:19,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:19,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:19,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:19,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:49:19,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:19,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:49:19,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:19,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:49:19,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:49:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:49:19,508 INFO L87 Difference]: Start difference. First operand 251228 states and 323622 transitions. Second operand 9 states. [2019-09-10 06:49:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:22,450 INFO L93 Difference]: Finished difference Result 792785 states and 1016160 transitions. [2019-09-10 06:49:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:49:22,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 06:49:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:30,809 INFO L225 Difference]: With dead ends: 792785 [2019-09-10 06:49:30,809 INFO L226 Difference]: Without dead ends: 792785 [2019-09-10 06:49:30,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:49:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792785 states. [2019-09-10 06:49:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792785 to 251213. [2019-09-10 06:49:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251213 states. [2019-09-10 06:49:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251213 states to 251213 states and 323606 transitions. [2019-09-10 06:49:36,819 INFO L78 Accepts]: Start accepts. Automaton has 251213 states and 323606 transitions. Word has length 93 [2019-09-10 06:49:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:36,819 INFO L475 AbstractCegarLoop]: Abstraction has 251213 states and 323606 transitions. [2019-09-10 06:49:36,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:49:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 251213 states and 323606 transitions. [2019-09-10 06:49:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:49:36,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:36,827 INFO L399 BasicCegarLoop]: trace histogram [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 06:49:36,827 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:36,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:36,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1974005961, now seen corresponding path program 1 times [2019-09-10 06:49:36,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:36,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:36,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:36,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:36,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:36,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:36,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:49:36,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:36,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:49:36,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:49:36,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:49:36,975 INFO L87 Difference]: Start difference. First operand 251213 states and 323606 transitions. Second operand 9 states. [2019-09-10 06:49:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:40,149 INFO L93 Difference]: Finished difference Result 737854 states and 948587 transitions. [2019-09-10 06:49:40,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:49:40,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 06:49:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:42,751 INFO L225 Difference]: With dead ends: 737854 [2019-09-10 06:49:42,751 INFO L226 Difference]: Without dead ends: 737854 [2019-09-10 06:49:42,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:49:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737854 states. [2019-09-10 06:49:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737854 to 252122. [2019-09-10 06:49:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252122 states. [2019-09-10 06:49:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252122 states to 252122 states and 324698 transitions. [2019-09-10 06:49:56,591 INFO L78 Accepts]: Start accepts. Automaton has 252122 states and 324698 transitions. Word has length 93 [2019-09-10 06:49:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:56,592 INFO L475 AbstractCegarLoop]: Abstraction has 252122 states and 324698 transitions. [2019-09-10 06:49:56,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:49:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 252122 states and 324698 transitions. [2019-09-10 06:49:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:49:56,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:56,600 INFO L399 BasicCegarLoop]: trace histogram [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 06:49:56,600 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash -440996839, now seen corresponding path program 1 times [2019-09-10 06:49:56,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:56,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:56,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:56,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:56,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:49:56,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:56,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:49:56,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:56,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:49:56,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:49:56,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:49:56,736 INFO L87 Difference]: Start difference. First operand 252122 states and 324698 transitions. Second operand 8 states. [2019-09-10 06:49:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:58,841 INFO L93 Difference]: Finished difference Result 406923 states and 523392 transitions. [2019-09-10 06:49:58,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:49:58,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-09-10 06:49:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:59,454 INFO L225 Difference]: With dead ends: 406923 [2019-09-10 06:49:59,454 INFO L226 Difference]: Without dead ends: 406923 [2019-09-10 06:49:59,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:50:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406923 states. [2019-09-10 06:50:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406923 to 252110. [2019-09-10 06:50:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252110 states. [2019-09-10 06:50:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252110 states to 252110 states and 324685 transitions. [2019-09-10 06:50:07,232 INFO L78 Accepts]: Start accepts. Automaton has 252110 states and 324685 transitions. Word has length 94 [2019-09-10 06:50:07,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:07,232 INFO L475 AbstractCegarLoop]: Abstraction has 252110 states and 324685 transitions. [2019-09-10 06:50:07,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:50:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 252110 states and 324685 transitions. [2019-09-10 06:50:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:50:07,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:07,244 INFO L399 BasicCegarLoop]: trace histogram [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 06:50:07,245 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:07,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash -602915897, now seen corresponding path program 1 times [2019-09-10 06:50:07,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:07,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:07,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:07,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:07,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:07,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:07,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:50:07,456 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-09-10 06:50:07,457 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [203], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [2589], [2593], [2596], [2599], [2602], [2610], [2612], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3887], [3933], [3936], [3939], [3943], [3946], [3950], [3954], [3956], [3959], [3963], [3966], [3969], [3973], [4241], [4244], [4247], [4251], [4255], [4259], [4342], [4344], [4986], [4987], [4991], [4992], [4993] [2019-09-10 06:50:07,492 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:50:07,492 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:50:07,659 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:50:08,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:50:08,058 INFO L272 AbstractInterpreter]: Visited 89 different actions 206 times. Merged at 27 different actions 105 times. Widened at 1 different actions 1 times. Performed 1033 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1033 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 253 variables. [2019-09-10 06:50:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:08,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:50:08,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:08,065 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 06:50:08,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:08,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:50:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:09,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:50:09,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:50:09,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:09,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:09,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:50:10,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:10,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:50:10,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2019-09-10 06:50:10,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:50:10,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:50:10,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:50:10,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:50:10,114 INFO L87 Difference]: Start difference. First operand 252110 states and 324685 transitions. Second operand 19 states. [2019-09-10 06:50:10,516 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 06:50:13,427 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-10 06:50:15,212 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 06:50:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:17,941 INFO L93 Difference]: Finished difference Result 626772 states and 801123 transitions. [2019-09-10 06:50:17,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:50:17,942 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2019-09-10 06:50:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:19,404 INFO L225 Difference]: With dead ends: 626772 [2019-09-10 06:50:19,405 INFO L226 Difference]: Without dead ends: 626772 [2019-09-10 06:50:19,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 168 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=417, Invalid=1475, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:50:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626772 states. [2019-09-10 06:50:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626772 to 252689. [2019-09-10 06:50:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252689 states. [2019-09-10 06:50:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252689 states to 252689 states and 325390 transitions. [2019-09-10 06:50:34,586 INFO L78 Accepts]: Start accepts. Automaton has 252689 states and 325390 transitions. Word has length 94 [2019-09-10 06:50:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:34,587 INFO L475 AbstractCegarLoop]: Abstraction has 252689 states and 325390 transitions. [2019-09-10 06:50:34,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:50:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 252689 states and 325390 transitions. [2019-09-10 06:50:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:50:34,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:34,615 INFO L399 BasicCegarLoop]: trace histogram [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 06:50:34,616 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:34,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1717699109, now seen corresponding path program 1 times [2019-09-10 06:50:34,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:34,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:34,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:34,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:34,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:50:34,760 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-09-10 06:50:34,760 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [73], [166], [169], [170], [172], [175], [180], [182], [203], [205], [1028], [1272], [1276], [1387], [1460], [1463], [1466], [1470], [1473], [1477], [1481], [1483], [1486], [1489], [1493], [2148], [2151], [2154], [2170], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [3479], [3482], [3486], [3488], [3491], [3494], [3498], [3502], [3505], [3508], [3511], [3513], [3542], [3561], [3563], [3582], [4986], [4987], [4991], [4992], [4993] [2019-09-10 06:50:34,775 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:50:34,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:50:34,857 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:50:35,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:50:35,104 INFO L272 AbstractInterpreter]: Visited 89 different actions 225 times. Merged at 28 different actions 124 times. Widened at 5 different actions 5 times. Performed 1104 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1104 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 253 variables. [2019-09-10 06:50:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:35,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:50:35,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:35,105 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 06:50:35,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:35,125 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 06:50:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:35,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 06:50:35,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:50:35,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:50:36,001 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:50:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:50:36,295 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:50:36,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [5] total 21 [2019-09-10 06:50:36,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:36,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:50:36,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:50:36,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:50:36,297 INFO L87 Difference]: Start difference. First operand 252689 states and 325390 transitions. Second operand 10 states. [2019-09-10 06:50:37,358 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:50:38,103 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 06:50:38,794 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 06:50:39,402 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 06:50:42,156 WARN L188 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:50:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:43,809 INFO L93 Difference]: Finished difference Result 542036 states and 690598 transitions. [2019-09-10 06:50:43,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:50:43,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 06:50:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:44,581 INFO L225 Difference]: With dead ends: 542036 [2019-09-10 06:50:44,581 INFO L226 Difference]: Without dead ends: 542036 [2019-09-10 06:50:44,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 167 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:50:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542036 states. [2019-09-10 06:50:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542036 to 285152. [2019-09-10 06:50:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285152 states. [2019-09-10 06:50:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285152 states to 285152 states and 365913 transitions. [2019-09-10 06:50:54,592 INFO L78 Accepts]: Start accepts. Automaton has 285152 states and 365913 transitions. Word has length 94 [2019-09-10 06:50:54,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:54,592 INFO L475 AbstractCegarLoop]: Abstraction has 285152 states and 365913 transitions. [2019-09-10 06:50:54,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:50:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 285152 states and 365913 transitions. [2019-09-10 06:50:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:50:54,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:54,604 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:50:54,605 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash 982202329, now seen corresponding path program 1 times [2019-09-10 06:50:54,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:54,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:54,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:54,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:54,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:50:54,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:54,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:50:54,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:50:54,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:50:54,862 INFO L87 Difference]: Start difference. First operand 285152 states and 365913 transitions. Second operand 12 states. [2019-09-10 06:50:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:59,977 INFO L93 Difference]: Finished difference Result 608245 states and 778442 transitions. [2019-09-10 06:50:59,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:50:59,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-09-10 06:50:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:01,965 INFO L225 Difference]: With dead ends: 608245 [2019-09-10 06:51:01,965 INFO L226 Difference]: Without dead ends: 608245 [2019-09-10 06:51:01,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:51:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608245 states. [2019-09-10 06:51:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608245 to 292542. [2019-09-10 06:51:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292542 states. [2019-09-10 06:51:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292542 states to 292542 states and 375419 transitions. [2019-09-10 06:51:12,799 INFO L78 Accepts]: Start accepts. Automaton has 292542 states and 375419 transitions. Word has length 95 [2019-09-10 06:51:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:12,799 INFO L475 AbstractCegarLoop]: Abstraction has 292542 states and 375419 transitions. [2019-09-10 06:51:12,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:51:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 292542 states and 375419 transitions. [2019-09-10 06:51:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:51:12,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:12,813 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:51:12,813 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:12,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:12,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2084722691, now seen corresponding path program 1 times [2019-09-10 06:51:12,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:12,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:12,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:13,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:13,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:51:13,806 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-09-10 06:51:13,808 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [185], [201], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2227], [2230], [2233], [2241], [2243], [3274], [3278], [3282], [3301], [3303], [3708], [3722], [3724], [3728], [4353], [4613], [4617], [4620], [4623], [4626], [4629], [4632], [4636], [4639], [4643], [4646], [4650], [4682], [4685], [4689], [4692], [4696], [4698], [4701], [4704], [4708], [4712], [4716], [4799], [4801], [4986], [4987], [4991], [4992], [4993] [2019-09-10 06:51:13,818 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:51:13,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:51:13,866 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:51:14,070 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:51:14,072 INFO L272 AbstractInterpreter]: Visited 90 different actions 215 times. Merged at 30 different actions 114 times. Widened at 5 different actions 8 times. Performed 1078 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1078 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 7 different actions. Largest state had 253 variables. [2019-09-10 06:51:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:14,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:51:14,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:14,072 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:51:14,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:14,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:51:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:14,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:51:14,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:51:14,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:51:14,745 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:51:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-10 06:51:14,992 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:51:14,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [5] total 19 [2019-09-10 06:51:14,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:14,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:51:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:51:14,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:51:14,994 INFO L87 Difference]: Start difference. First operand 292542 states and 375419 transitions. Second operand 9 states. [2019-09-10 06:51:15,681 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 06:51:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:17,498 INFO L93 Difference]: Finished difference Result 374867 states and 479283 transitions. [2019-09-10 06:51:17,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:51:17,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 06:51:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:19,148 INFO L225 Difference]: With dead ends: 374867 [2019-09-10 06:51:19,148 INFO L226 Difference]: Without dead ends: 374867 [2019-09-10 06:51:19,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 173 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:51:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374867 states. [2019-09-10 06:51:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374867 to 292532. [2019-09-10 06:51:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292532 states. [2019-09-10 06:51:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292532 states to 292532 states and 375190 transitions. [2019-09-10 06:51:28,153 INFO L78 Accepts]: Start accepts. Automaton has 292532 states and 375190 transitions. Word has length 95 [2019-09-10 06:51:28,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:28,153 INFO L475 AbstractCegarLoop]: Abstraction has 292532 states and 375190 transitions. [2019-09-10 06:51:28,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:51:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 292532 states and 375190 transitions. [2019-09-10 06:51:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:51:28,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:28,162 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:51:28,163 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1487914464, now seen corresponding path program 1 times [2019-09-10 06:51:28,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:28,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:28,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:28,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:28,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:28,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:28,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:28,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:28,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:28,220 INFO L87 Difference]: Start difference. First operand 292532 states and 375190 transitions. Second operand 3 states. [2019-09-10 06:51:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:28,971 INFO L93 Difference]: Finished difference Result 292534 states and 368415 transitions. [2019-09-10 06:51:28,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:28,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 06:51:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:29,320 INFO L225 Difference]: With dead ends: 292534 [2019-09-10 06:51:29,320 INFO L226 Difference]: Without dead ends: 292534 [2019-09-10 06:51:29,320 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 06:51:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292534 states. [2019-09-10 06:51:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292534 to 292429. [2019-09-10 06:51:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292429 states. [2019-09-10 06:51:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292429 states to 292429 states and 368299 transitions. [2019-09-10 06:51:37,187 INFO L78 Accepts]: Start accepts. Automaton has 292429 states and 368299 transitions. Word has length 95 [2019-09-10 06:51:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:37,187 INFO L475 AbstractCegarLoop]: Abstraction has 292429 states and 368299 transitions. [2019-09-10 06:51:37,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:51:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 292429 states and 368299 transitions. [2019-09-10 06:51:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:51:37,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:37,194 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:51:37,194 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash -286705209, now seen corresponding path program 1 times [2019-09-10 06:51:37,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:37,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:37,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:37,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:37,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:37,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:37,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:51:37,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-09-10 06:51:37,315 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [203], [205], [2148], [2151], [2172], [2174], [2176], [2179], [2182], [2198], [2202], [2204], [2207], [2210], [2212], [2217], [2222], [2224], [2243], [2245], [2264], [2589], [2593], [2596], [2599], [2602], [2610], [2612], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3887], [3933], [3936], [3939], [3943], [3946], [3950], [3954], [3956], [3959], [3963], [3966], [3969], [3973], [4241], [4244], [4247], [4251], [4255], [4259], [4342], [4344], [4986], [4987], [4991], [4992], [4993] [2019-09-10 06:51:37,317 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:51:37,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:51:37,365 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:51:37,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:51:37,558 INFO L272 AbstractInterpreter]: Visited 90 different actions 213 times. Merged at 28 different actions 112 times. Widened at 5 different actions 5 times. Performed 1056 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1056 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 6 different actions. Largest state had 253 variables. [2019-09-10 06:51:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:37,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:51:37,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:37,558 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 06:51:37,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:37,581 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 06:51:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:37,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 06:51:37,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:51:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:37,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:51:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:37,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:51:37,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-09-10 06:51:37,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:51:37,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:51:37,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:51:37,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:51:37,958 INFO L87 Difference]: Start difference. First operand 292429 states and 368299 transitions. Second operand 7 states. [2019-09-10 06:51:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:39,153 INFO L93 Difference]: Finished difference Result 456836 states and 569075 transitions. [2019-09-10 06:51:39,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:51:39,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-10 06:51:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:41,163 INFO L225 Difference]: With dead ends: 456836 [2019-09-10 06:51:41,163 INFO L226 Difference]: Without dead ends: 456836 [2019-09-10 06:51:41,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:51:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456836 states. [2019-09-10 06:51:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456836 to 366267. [2019-09-10 06:51:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366267 states. [2019-09-10 06:51:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366267 states to 366267 states and 459887 transitions. [2019-09-10 06:51:50,872 INFO L78 Accepts]: Start accepts. Automaton has 366267 states and 459887 transitions. Word has length 95 [2019-09-10 06:51:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:50,872 INFO L475 AbstractCegarLoop]: Abstraction has 366267 states and 459887 transitions. [2019-09-10 06:51:50,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:51:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 366267 states and 459887 transitions. [2019-09-10 06:51:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 06:51:50,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:50,880 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:51:50,881 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash -802766303, now seen corresponding path program 1 times [2019-09-10 06:51:50,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:50,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:50,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:50,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:50,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:50,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:50,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:50,952 INFO L87 Difference]: Start difference. First operand 366267 states and 459887 transitions. Second operand 3 states. [2019-09-10 06:51:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:52,707 INFO L93 Difference]: Finished difference Result 279602 states and 346505 transitions. [2019-09-10 06:51:52,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:52,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 06:51:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:53,024 INFO L225 Difference]: With dead ends: 279602 [2019-09-10 06:51:53,024 INFO L226 Difference]: Without dead ends: 279602 [2019-09-10 06:51:53,024 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 06:51:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279602 states. [2019-09-10 06:52:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279602 to 279238. [2019-09-10 06:52:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279238 states. [2019-09-10 06:52:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279238 states to 279238 states and 346122 transitions. [2019-09-10 06:52:01,100 INFO L78 Accepts]: Start accepts. Automaton has 279238 states and 346122 transitions. Word has length 96 [2019-09-10 06:52:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:01,101 INFO L475 AbstractCegarLoop]: Abstraction has 279238 states and 346122 transitions. [2019-09-10 06:52:01,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 279238 states and 346122 transitions. [2019-09-10 06:52:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:52:01,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:01,108 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:52:01,108 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1316813398, now seen corresponding path program 1 times [2019-09-10 06:52:01,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:01,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:01,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:01,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:52:01,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:01,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:52:01,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:01,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:52:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:52:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:52:01,167 INFO L87 Difference]: Start difference. First operand 279238 states and 346122 transitions. Second operand 4 states. [2019-09-10 06:52:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:03,531 INFO L93 Difference]: Finished difference Result 442022 states and 546086 transitions. [2019-09-10 06:52:03,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:52:03,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 06:52:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:04,168 INFO L225 Difference]: With dead ends: 442022 [2019-09-10 06:52:04,169 INFO L226 Difference]: Without dead ends: 442022 [2019-09-10 06:52:04,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:52:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442022 states. [2019-09-10 06:52:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442022 to 313867. [2019-09-10 06:52:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313867 states. [2019-09-10 06:52:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313867 states to 313867 states and 389618 transitions. [2019-09-10 06:52:14,161 INFO L78 Accepts]: Start accepts. Automaton has 313867 states and 389618 transitions. Word has length 97 [2019-09-10 06:52:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:14,161 INFO L475 AbstractCegarLoop]: Abstraction has 313867 states and 389618 transitions. [2019-09-10 06:52:14,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:52:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 313867 states and 389618 transitions. [2019-09-10 06:52:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:52:14,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:14,169 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:52:14,169 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1191866658, now seen corresponding path program 1 times [2019-09-10 06:52:14,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:14,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:14,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:14,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:14,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:52:14,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:14,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:52:14,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:14,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:52:14,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:52:14,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:52:14,250 INFO L87 Difference]: Start difference. First operand 313867 states and 389618 transitions. Second operand 5 states. [2019-09-10 06:52:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:16,231 INFO L93 Difference]: Finished difference Result 348730 states and 430632 transitions. [2019-09-10 06:52:16,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:52:16,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 06:52:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:16,746 INFO L225 Difference]: With dead ends: 348730 [2019-09-10 06:52:16,746 INFO L226 Difference]: Without dead ends: 348730 [2019-09-10 06:52:16,747 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 06:52:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348730 states. [2019-09-10 06:52:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348730 to 300659. [2019-09-10 06:52:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300659 states. [2019-09-10 06:52:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300659 states to 300659 states and 371778 transitions. [2019-09-10 06:52:25,226 INFO L78 Accepts]: Start accepts. Automaton has 300659 states and 371778 transitions. Word has length 97 [2019-09-10 06:52:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:25,226 INFO L475 AbstractCegarLoop]: Abstraction has 300659 states and 371778 transitions. [2019-09-10 06:52:25,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:52:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 300659 states and 371778 transitions. [2019-09-10 06:52:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:52:25,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:25,234 INFO L399 BasicCegarLoop]: trace histogram [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 06:52:25,234 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:25,234 INFO L82 PathProgramCache]: Analyzing trace with hash -186718423, now seen corresponding path program 1 times [2019-09-10 06:52:25,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:25,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:25,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:25,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:25,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:26,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:26,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:52:26,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:26,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:52:26,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:52:26,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:52:26,117 INFO L87 Difference]: Start difference. First operand 300659 states and 371778 transitions. Second operand 5 states. [2019-09-10 06:52:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:27,237 INFO L93 Difference]: Finished difference Result 302718 states and 369362 transitions. [2019-09-10 06:52:27,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:52:27,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 06:52:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:27,592 INFO L225 Difference]: With dead ends: 302718 [2019-09-10 06:52:27,592 INFO L226 Difference]: Without dead ends: 302718 [2019-09-10 06:52:27,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:52:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302718 states. [2019-09-10 06:52:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302718 to 278728. [2019-09-10 06:52:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278728 states. [2019-09-10 06:52:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278728 states to 278728 states and 339248 transitions. [2019-09-10 06:52:39,245 INFO L78 Accepts]: Start accepts. Automaton has 278728 states and 339248 transitions. Word has length 98 [2019-09-10 06:52:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:39,245 INFO L475 AbstractCegarLoop]: Abstraction has 278728 states and 339248 transitions. [2019-09-10 06:52:39,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:52:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 278728 states and 339248 transitions. [2019-09-10 06:52:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:52:39,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:39,252 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:52:39,252 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1378332097, now seen corresponding path program 1 times [2019-09-10 06:52:39,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:39,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:39,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:39,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:39,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:39,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:39,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:52:39,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:39,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:52:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:52:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:52:39,349 INFO L87 Difference]: Start difference. First operand 278728 states and 339248 transitions. Second operand 5 states. [2019-09-10 06:52:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:40,112 INFO L93 Difference]: Finished difference Result 335871 states and 408022 transitions. [2019-09-10 06:52:40,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:52:40,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 06:52:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:40,550 INFO L225 Difference]: With dead ends: 335871 [2019-09-10 06:52:40,550 INFO L226 Difference]: Without dead ends: 335871 [2019-09-10 06:52:40,550 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 06:52:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335871 states. [2019-09-10 06:52:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335871 to 303680. [2019-09-10 06:52:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303680 states. [2019-09-10 06:52:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303680 states to 303680 states and 368688 transitions. [2019-09-10 06:52:45,260 INFO L78 Accepts]: Start accepts. Automaton has 303680 states and 368688 transitions. Word has length 98 [2019-09-10 06:52:45,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:45,261 INFO L475 AbstractCegarLoop]: Abstraction has 303680 states and 368688 transitions. [2019-09-10 06:52:45,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:52:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 303680 states and 368688 transitions. [2019-09-10 06:52:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:52:45,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:45,269 INFO L399 BasicCegarLoop]: trace histogram [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 06:52:45,270 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:45,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:45,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1537742470, now seen corresponding path program 1 times [2019-09-10 06:52:45,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:45,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:45,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:45,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:45,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:52:45,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:45,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:52:45,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:45,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:52:45,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:52:45,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:45,355 INFO L87 Difference]: Start difference. First operand 303680 states and 368688 transitions. Second operand 3 states. [2019-09-10 06:52:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:45,933 INFO L93 Difference]: Finished difference Result 281573 states and 339161 transitions. [2019-09-10 06:52:45,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:52:45,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 06:52:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:46,331 INFO L225 Difference]: With dead ends: 281573 [2019-09-10 06:52:46,332 INFO L226 Difference]: Without dead ends: 264951 [2019-09-10 06:52:46,332 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 06:52:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264951 states. [2019-09-10 06:52:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264951 to 192827. [2019-09-10 06:52:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192827 states. [2019-09-10 06:52:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192827 states to 192827 states and 233432 transitions. [2019-09-10 06:52:54,095 INFO L78 Accepts]: Start accepts. Automaton has 192827 states and 233432 transitions. Word has length 100 [2019-09-10 06:52:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:54,095 INFO L475 AbstractCegarLoop]: Abstraction has 192827 states and 233432 transitions. [2019-09-10 06:52:54,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 192827 states and 233432 transitions. [2019-09-10 06:52:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:52:54,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:54,101 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:52:54,102 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:54,102 INFO L82 PathProgramCache]: Analyzing trace with hash 887178001, now seen corresponding path program 1 times [2019-09-10 06:52:54,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:54,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:54,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:54,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:54,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:54,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:54,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:52:54,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:54,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:52:54,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:52:54,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:54,149 INFO L87 Difference]: Start difference. First operand 192827 states and 233432 transitions. Second operand 3 states. [2019-09-10 06:52:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:54,687 INFO L93 Difference]: Finished difference Result 286672 states and 345177 transitions. [2019-09-10 06:52:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:52:54,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 06:52:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:55,033 INFO L225 Difference]: With dead ends: 286672 [2019-09-10 06:52:55,034 INFO L226 Difference]: Without dead ends: 286672 [2019-09-10 06:52:55,034 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 06:52:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286672 states. [2019-09-10 06:52:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286672 to 183941. [2019-09-10 06:52:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183941 states. [2019-09-10 06:52:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183941 states to 183941 states and 221282 transitions. [2019-09-10 06:52:58,421 INFO L78 Accepts]: Start accepts. Automaton has 183941 states and 221282 transitions. Word has length 101 [2019-09-10 06:52:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:58,421 INFO L475 AbstractCegarLoop]: Abstraction has 183941 states and 221282 transitions. [2019-09-10 06:52:58,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 183941 states and 221282 transitions. [2019-09-10 06:52:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:52:58,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:58,428 INFO L399 BasicCegarLoop]: trace histogram [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 06:52:58,428 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:58,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1476573405, now seen corresponding path program 1 times [2019-09-10 06:52:58,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:58,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:58,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:58,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:58,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:52:58,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:58,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:52:58,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:58,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:52:58,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:52:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:52:58,559 INFO L87 Difference]: Start difference. First operand 183941 states and 221282 transitions. Second operand 9 states. [2019-09-10 06:53:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:00,254 INFO L93 Difference]: Finished difference Result 266271 states and 319067 transitions. [2019-09-10 06:53:00,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:53:00,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 06:53:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:00,567 INFO L225 Difference]: With dead ends: 266271 [2019-09-10 06:53:00,567 INFO L226 Difference]: Without dead ends: 266271 [2019-09-10 06:53:00,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:53:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266271 states. [2019-09-10 06:53:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266271 to 183941. [2019-09-10 06:53:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183941 states. [2019-09-10 06:53:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183941 states to 183941 states and 221280 transitions. [2019-09-10 06:53:03,004 INFO L78 Accepts]: Start accepts. Automaton has 183941 states and 221280 transitions. Word has length 103 [2019-09-10 06:53:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:03,004 INFO L475 AbstractCegarLoop]: Abstraction has 183941 states and 221280 transitions. [2019-09-10 06:53:03,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:53:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 183941 states and 221280 transitions. [2019-09-10 06:53:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:53:03,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:03,011 INFO L399 BasicCegarLoop]: trace histogram [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 06:53:03,011 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1536461249, now seen corresponding path program 1 times [2019-09-10 06:53:03,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:03,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:03,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:03,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:03,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:53:03,203 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 06:53:03,203 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [166], [169], [170], [172], [175], [180], [182], [185], [201], [205], [2148], [2151], [2154], [2157], [2162], [2165], [2174], [2176], [2179], [2200], [2202], [2204], [2207], [2210], [2220], [2222], [2224], [2227], [2230], [2233], [2241], [2243], [2266], [2269], [2272], [2275], [2283], [2285], [3708], [3722], [3724], [3728], [3731], [3734], [3737], [3741], [3744], [3747], [3750], [3753], [3756], [3760], [3763], [3767], [3770], [3774], [3806], [3809], [3813], [3816], [3819], [3822], [3827], [3830], [3833], [3836], [3840], [3844], [3848], [3851], [3854], [3857], [3865], [3869], [4986], [4987], [4991], [4992], [4993] [2019-09-10 06:53:03,206 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:53:03,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:53:03,253 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:53:03,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:53:03,618 INFO L272 AbstractInterpreter]: Visited 99 different actions 430 times. Merged at 38 different actions 302 times. Widened at 15 different actions 50 times. Performed 1607 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1607 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 13 different actions. Largest state had 255 variables. [2019-09-10 06:53:03,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:03,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:53:03,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:03,619 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:53:04,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:04,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:53:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:04,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:53:04,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:53:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:04,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:53:05,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:05,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:05,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:05,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:07,754 WARN L188 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-09-10 06:53:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:08,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:53:08,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 26 [2019-09-10 06:53:08,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:53:08,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:53:08,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:53:08,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:53:08,558 INFO L87 Difference]: Start difference. First operand 183941 states and 221280 transitions. Second operand 19 states. [2019-09-10 06:53:09,004 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 06:53:09,408 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:53:09,649 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 06:53:09,902 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 06:53:10,158 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 06:53:10,696 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-09-10 06:53:11,142 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 06:53:12,785 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 06:53:13,274 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 06:53:13,804 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 06:53:14,753 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 06:53:14,936 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 06:53:15,591 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-09-10 06:53:17,273 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 06:53:17,724 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 06:53:18,240 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 06:53:18,568 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 06:53:19,130 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 06:53:19,535 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:53:19,869 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 06:53:20,034 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:53:20,432 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 06:53:20,611 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 06:53:21,198 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 06:53:21,653 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:53:22,388 WARN L188 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 06:53:22,611 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:53:22,864 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:53:23,111 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 06:53:23,678 WARN L188 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:53:24,199 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 06:53:24,467 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 06:53:25,100 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 06:53:25,473 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:53:25,696 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:53:27,711 WARN L188 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 06:53:28,347 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:53:28,758 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 06:53:29,062 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 06:53:30,062 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 06:53:30,537 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:53:30,830 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:53:31,151 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:53:31,370 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:53:31,770 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:53:32,080 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:53:32,366 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:53:32,729 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 06:53:33,176 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:53:34,740 WARN L188 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 06:53:35,139 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:53:35,450 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:53:35,826 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:53:36,325 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:53:36,675 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:53:37,103 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:53:37,443 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 06:53:37,625 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:53:37,988 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:53:38,620 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:53:38,834 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:53:39,096 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 06:53:39,379 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:53:39,756 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 06:53:40,204 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:53:40,638 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 06:53:40,887 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 06:53:41,308 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:53:41,677 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 06:53:41,939 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:53:42,801 WARN L188 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 06:53:43,170 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 06:53:43,607 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:53:43,860 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 06:53:44,155 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:53:44,684 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:53:45,200 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:53:45,637 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:53:46,177 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 06:53:46,499 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:53:47,026 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:53:48,136 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:53:48,404 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:53:49,106 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 06:53:49,872 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-10 06:53:50,502 WARN L188 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:53:51,040 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:53:51,858 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 06:53:52,146 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 06:53:52,684 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 06:53:53,096 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-10 06:53:53,882 WARN L188 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 06:53:54,241 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:53:55,744 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-09-10 06:53:56,324 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 06:53:57,244 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:53:57,541 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-10 06:53:57,896 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 06:53:58,430 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 06:53:58,832 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 06:53:59,063 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 06:53:59,647 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:54:00,100 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:54:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:01,451 INFO L93 Difference]: Finished difference Result 568662 states and 675961 transitions. [2019-09-10 06:54:01,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-10 06:54:01,452 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 104 [2019-09-10 06:54:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:01,453 INFO L225 Difference]: With dead ends: 568662 [2019-09-10 06:54:01,453 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 06:54:01,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 232 SyntacticMatches, 16 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=3747, Invalid=13809, Unknown=0, NotChecked=0, Total=17556 [2019-09-10 06:54:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 06:54:01,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 06:54:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 06:54:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 06:54:01,457 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2019-09-10 06:54:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:01,457 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 06:54:01,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:54:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 06:54:01,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 06:54:01,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 06:54:01 BoogieIcfgContainer [2019-09-10 06:54:01,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 06:54:01,464 INFO L168 Benchmark]: Toolchain (without parser) took 362800.98 ms. Allocated memory was 134.7 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 84.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-09-10 06:54:01,465 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 06:54:01,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1498.50 ms. Allocated memory was 134.7 MB in the beginning and 223.3 MB in the end (delta: 88.6 MB). Free memory was 84.3 MB in the beginning and 126.8 MB in the end (delta: -42.5 MB). Peak memory consumption was 52.3 MB. Max. memory is 7.1 GB. [2019-09-10 06:54:01,466 INFO L168 Benchmark]: Boogie Preprocessor took 209.82 ms. Allocated memory is still 223.3 MB. Free memory was 126.8 MB in the beginning and 113.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2019-09-10 06:54:01,466 INFO L168 Benchmark]: RCFGBuilder took 3330.58 ms. Allocated memory was 223.3 MB in the beginning and 341.8 MB in the end (delta: 118.5 MB). Free memory was 113.6 MB in the beginning and 190.2 MB in the end (delta: -76.7 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2019-09-10 06:54:01,467 INFO L168 Benchmark]: TraceAbstraction took 357756.16 ms. Allocated memory was 341.8 MB in the beginning and 3.8 GB in the end (delta: 3.5 GB). Free memory was 190.2 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-09-10 06:54:01,470 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1498.50 ms. Allocated memory was 134.7 MB in the beginning and 223.3 MB in the end (delta: 88.6 MB). Free memory was 84.3 MB in the beginning and 126.8 MB in the end (delta: -42.5 MB). Peak memory consumption was 52.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 209.82 ms. Allocated memory is still 223.3 MB. Free memory was 126.8 MB in the beginning and 113.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3330.58 ms. Allocated memory was 223.3 MB in the beginning and 341.8 MB in the end (delta: 118.5 MB). Free memory was 113.6 MB in the beginning and 190.2 MB in the end (delta: -76.7 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 357756.16 ms. Allocated memory was 341.8 MB in the beginning and 3.8 GB in the end (delta: 3.5 GB). Free memory was 190.2 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3441]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1316]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 719]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 370]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1850]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5726]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 1259 locations, 6 error locations. SAFE Result, 357.6s OverallTime, 46 OverallIterations, 2 TraceHistogramMax, 156.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27375 SDtfs, 83030 SDslu, 62093 SDs, 0 SdLazy, 41411 SolverSat, 2389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1663 GetRequests, 1020 SyntacticMatches, 39 SemanticMatches, 604 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7963 ImplicationChecksByTransitivity, 60.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366267occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 180.3s AutomataMinimizationTime, 46 MinimizatonAttempts, 3516577 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 4108 NumberOfCodeBlocks, 4108 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4534 ConstructedInterpolants, 168 QuantifiedInterpolants, 3322293 SizeOfPredicates, 44 NumberOfNonLiveVariables, 6770 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 56 InterpolantComputations, 45 PerfectInterpolantSequences, 212/258 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...