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.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:01:56,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:01:56,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:01:56,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:01:56,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:01:56,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:01:56,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:01:56,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:01:56,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:01:56,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:01:56,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:01:56,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:01:56,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:01:56,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:01:56,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:01:56,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:01:56,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:01:56,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:01:56,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:01:56,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:01:56,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:01:56,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:01:56,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:01:56,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:01:56,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:01:56,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:01:56,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:01:56,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:01:56,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:01:56,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:01:56,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:01:56,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:01:56,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:01:56,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:01:56,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:01:56,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:01:56,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:01:56,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:01:56,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:01:56,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:01:56,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:01:56,168 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-10-03 03:01:56,183 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:01:56,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:01:56,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:01:56,184 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:01:56,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:01:56,184 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:01:56,185 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:01:56,185 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:01:56,185 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:01:56,185 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:01:56,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:01:56,186 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:01:56,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:01:56,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:01:56,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:01:56,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:01:56,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:01:56,187 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:01:56,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:01:56,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:01:56,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:01:56,188 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:01:56,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:01:56,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:01:56,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:01:56,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:01:56,189 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:01:56,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:01:56,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:01:56,190 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:01:56,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:01:56,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:01:56,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:01:56,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:01:56,234 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:01:56,235 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.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-03 03:01:56,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dcfd07d3/8c3bd318672f461f9bb4a597f79dfed7/FLAG277f308e8 [2019-10-03 03:01:56,974 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:01:56,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-03 03:01:57,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dcfd07d3/8c3bd318672f461f9bb4a597f79dfed7/FLAG277f308e8 [2019-10-03 03:01:57,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dcfd07d3/8c3bd318672f461f9bb4a597f79dfed7 [2019-10-03 03:01:57,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:01:57,117 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:01:57,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:01:57,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:01:57,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:01:57,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:01:57" (1/1) ... [2019-10-03 03:01:57,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255f04f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:57, skipping insertion in model container [2019-10-03 03:01:57,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:01:57" (1/1) ... [2019-10-03 03:01:57,136 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:01:57,286 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:01:58,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:01:58,397 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:01:58,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:01:58,821 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:01:58,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58 WrapperNode [2019-10-03 03:01:58,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:01:58,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:01:58,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:01:58,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:01:58,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:59,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:59,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:59,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:01:59,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:01:59,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:01:59,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:01:59,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (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-10-03 03:01:59,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:01:59,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:01:59,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:01:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:01:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:01:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:01:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:01:59,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:01:59,169 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:01:59,169 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:01:59,169 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-03 03:01:59,170 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-03 03:01:59,170 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-03 03:01:59,170 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:01:59,170 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:01:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:01:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:01:59,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:02:02,638 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:02:02,639 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 03:02:02,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:02:02 BoogieIcfgContainer [2019-10-03 03:02:02,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:02:02,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:02:02,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:02:02,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:02:02,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:01:57" (1/3) ... [2019-10-03 03:02:02,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612c28da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:02:02, skipping insertion in model container [2019-10-03 03:02:02,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (2/3) ... [2019-10-03 03:02:02,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612c28da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:02:02, skipping insertion in model container [2019-10-03 03:02:02,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:02:02" (3/3) ... [2019-10-03 03:02:02,649 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-03 03:02:02,658 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:02:02,668 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-03 03:02:02,685 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-03 03:02:02,712 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:02:02,713 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:02:02,713 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:02:02,713 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:02:02,713 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:02:02,713 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:02:02,713 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:02:02,714 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:02:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states. [2019-10-03 03:02:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:02:02,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:02,778 INFO L411 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-10-03 03:02:02,780 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:02,787 INFO L82 PathProgramCache]: Analyzing trace with hash 543541410, now seen corresponding path program 1 times [2019-10-03 03:02:02,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:02,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:02,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:02,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:02,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:03,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:03,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:03,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:03,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:03,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:03,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:03,509 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand 5 states. [2019-10-03 03:02:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:05,697 INFO L93 Difference]: Finished difference Result 1606 states and 2695 transitions. [2019-10-03 03:02:05,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:05,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-03 03:02:05,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:05,723 INFO L225 Difference]: With dead ends: 1606 [2019-10-03 03:02:05,723 INFO L226 Difference]: Without dead ends: 1594 [2019-10-03 03:02:05,725 INFO L640 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-10-03 03:02:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2019-10-03 03:02:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1588. [2019-10-03 03:02:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2019-10-03 03:02:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2070 transitions. [2019-10-03 03:02:05,844 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2070 transitions. Word has length 56 [2019-10-03 03:02:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:05,845 INFO L475 AbstractCegarLoop]: Abstraction has 1588 states and 2070 transitions. [2019-10-03 03:02:05,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2070 transitions. [2019-10-03 03:02:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:05,855 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:05,856 INFO L411 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-10-03 03:02:05,856 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash 653011577, now seen corresponding path program 1 times [2019-10-03 03:02:05,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:05,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:05,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:05,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:05,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:06,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:06,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:06,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:06,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:06,111 INFO L87 Difference]: Start difference. First operand 1588 states and 2070 transitions. Second operand 6 states. [2019-10-03 03:02:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:07,412 INFO L93 Difference]: Finished difference Result 2603 states and 3432 transitions. [2019-10-03 03:02:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:07,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-03 03:02:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:07,426 INFO L225 Difference]: With dead ends: 2603 [2019-10-03 03:02:07,427 INFO L226 Difference]: Without dead ends: 2603 [2019-10-03 03:02:07,428 INFO L640 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-10-03 03:02:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-10-03 03:02:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2580. [2019-10-03 03:02:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2019-10-03 03:02:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3414 transitions. [2019-10-03 03:02:07,485 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3414 transitions. Word has length 57 [2019-10-03 03:02:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:07,486 INFO L475 AbstractCegarLoop]: Abstraction has 2580 states and 3414 transitions. [2019-10-03 03:02:07,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3414 transitions. [2019-10-03 03:02:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:07,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:07,489 INFO L411 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-10-03 03:02:07,490 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:07,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:07,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2124615921, now seen corresponding path program 1 times [2019-10-03 03:02:07,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:07,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:07,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:07,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:07,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:07,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:07,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:07,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:07,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:07,644 INFO L87 Difference]: Start difference. First operand 2580 states and 3414 transitions. Second operand 6 states. [2019-10-03 03:02:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:08,908 INFO L93 Difference]: Finished difference Result 4454 states and 5932 transitions. [2019-10-03 03:02:08,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:08,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-03 03:02:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:08,938 INFO L225 Difference]: With dead ends: 4454 [2019-10-03 03:02:08,948 INFO L226 Difference]: Without dead ends: 4454 [2019-10-03 03:02:08,949 INFO L640 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-10-03 03:02:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-10-03 03:02:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4438. [2019-10-03 03:02:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-03 03:02:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5921 transitions. [2019-10-03 03:02:09,097 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5921 transitions. Word has length 57 [2019-10-03 03:02:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:09,099 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5921 transitions. [2019-10-03 03:02:09,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5921 transitions. [2019-10-03 03:02:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:02:09,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:09,104 INFO L411 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-10-03 03:02:09,105 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:09,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1225390693, now seen corresponding path program 1 times [2019-10-03 03:02:09,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:09,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:09,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:09,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:09,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:09,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:09,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:02:09,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:09,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:09,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:09,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:09,382 INFO L87 Difference]: Start difference. First operand 4438 states and 5921 transitions. Second operand 9 states. [2019-10-03 03:02:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:12,471 INFO L93 Difference]: Finished difference Result 8486 states and 12028 transitions. [2019-10-03 03:02:12,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:02:12,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-03 03:02:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:12,510 INFO L225 Difference]: With dead ends: 8486 [2019-10-03 03:02:12,511 INFO L226 Difference]: Without dead ends: 8486 [2019-10-03 03:02:12,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:02:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2019-10-03 03:02:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 4438. [2019-10-03 03:02:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-03 03:02:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5920 transitions. [2019-10-03 03:02:12,678 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5920 transitions. Word has length 59 [2019-10-03 03:02:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:12,679 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5920 transitions. [2019-10-03 03:02:12,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5920 transitions. [2019-10-03 03:02:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:02:12,684 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:12,684 INFO L411 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-10-03 03:02:12,684 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2072576560, now seen corresponding path program 1 times [2019-10-03 03:02:12,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:12,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:12,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:12,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:12,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:02:12,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:12,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:12,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:12,902 INFO L87 Difference]: Start difference. First operand 4438 states and 5920 transitions. Second operand 9 states. [2019-10-03 03:02:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:16,289 INFO L93 Difference]: Finished difference Result 11461 states and 16045 transitions. [2019-10-03 03:02:16,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 03:02:16,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-03 03:02:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:16,339 INFO L225 Difference]: With dead ends: 11461 [2019-10-03 03:02:16,340 INFO L226 Difference]: Without dead ends: 11461 [2019-10-03 03:02:16,340 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:02:16,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-10-03 03:02:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 4438. [2019-10-03 03:02:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-03 03:02:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5919 transitions. [2019-10-03 03:02:16,500 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5919 transitions. Word has length 59 [2019-10-03 03:02:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:16,501 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5919 transitions. [2019-10-03 03:02:16,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5919 transitions. [2019-10-03 03:02:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:02:16,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:16,505 INFO L411 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-10-03 03:02:16,505 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:16,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:16,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1462179803, now seen corresponding path program 1 times [2019-10-03 03:02:16,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:16,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:16,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:16,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:16,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:16,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:16,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:02:16,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:16,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:02:16,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:02:16,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:16,694 INFO L87 Difference]: Start difference. First operand 4438 states and 5919 transitions. Second operand 8 states. [2019-10-03 03:02:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:19,117 INFO L93 Difference]: Finished difference Result 8253 states and 11771 transitions. [2019-10-03 03:02:19,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 03:02:19,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-10-03 03:02:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:19,136 INFO L225 Difference]: With dead ends: 8253 [2019-10-03 03:02:19,136 INFO L226 Difference]: Without dead ends: 8253 [2019-10-03 03:02:19,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:02:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8253 states. [2019-10-03 03:02:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8253 to 4438. [2019-10-03 03:02:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-03 03:02:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5918 transitions. [2019-10-03 03:02:19,236 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5918 transitions. Word has length 59 [2019-10-03 03:02:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:19,236 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5918 transitions. [2019-10-03 03:02:19,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:02:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5918 transitions. [2019-10-03 03:02:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:19,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:19,241 INFO L411 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-10-03 03:02:19,241 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:19,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:19,242 INFO L82 PathProgramCache]: Analyzing trace with hash 895594476, now seen corresponding path program 1 times [2019-10-03 03:02:19,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:19,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:19,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:19,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:19,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:19,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:19,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:19,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:19,335 INFO L87 Difference]: Start difference. First operand 4438 states and 5918 transitions. Second operand 3 states. [2019-10-03 03:02:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:19,491 INFO L93 Difference]: Finished difference Result 5548 states and 7353 transitions. [2019-10-03 03:02:19,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:19,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 03:02:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:19,505 INFO L225 Difference]: With dead ends: 5548 [2019-10-03 03:02:19,505 INFO L226 Difference]: Without dead ends: 5548 [2019-10-03 03:02:19,505 INFO L640 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-10-03 03:02:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2019-10-03 03:02:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5542. [2019-10-03 03:02:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2019-10-03 03:02:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7349 transitions. [2019-10-03 03:02:19,598 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7349 transitions. Word has length 60 [2019-10-03 03:02:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:19,600 INFO L475 AbstractCegarLoop]: Abstraction has 5542 states and 7349 transitions. [2019-10-03 03:02:19,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7349 transitions. [2019-10-03 03:02:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:19,606 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:19,606 INFO L411 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-10-03 03:02:19,607 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:19,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:19,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1516341452, now seen corresponding path program 1 times [2019-10-03 03:02:19,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:19,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:19,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:19,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:19,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:19,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:19,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:19,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:19,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:19,757 INFO L87 Difference]: Start difference. First operand 5542 states and 7349 transitions. Second operand 3 states. [2019-10-03 03:02:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:19,854 INFO L93 Difference]: Finished difference Result 6694 states and 9131 transitions. [2019-10-03 03:02:19,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:19,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 03:02:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:19,866 INFO L225 Difference]: With dead ends: 6694 [2019-10-03 03:02:19,866 INFO L226 Difference]: Without dead ends: 6694 [2019-10-03 03:02:19,866 INFO L640 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-10-03 03:02:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2019-10-03 03:02:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 6090. [2019-10-03 03:02:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6090 states. [2019-10-03 03:02:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 8232 transitions. [2019-10-03 03:02:19,953 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 8232 transitions. Word has length 60 [2019-10-03 03:02:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:19,953 INFO L475 AbstractCegarLoop]: Abstraction has 6090 states and 8232 transitions. [2019-10-03 03:02:19,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 8232 transitions. [2019-10-03 03:02:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:19,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:19,958 INFO L411 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-10-03 03:02:19,958 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash -514589220, now seen corresponding path program 1 times [2019-10-03 03:02:19,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:20,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:20,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:20,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:20,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:20,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:20,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:20,085 INFO L87 Difference]: Start difference. First operand 6090 states and 8232 transitions. Second operand 3 states. [2019-10-03 03:02:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:20,174 INFO L93 Difference]: Finished difference Result 8067 states and 11112 transitions. [2019-10-03 03:02:20,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:20,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 03:02:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:20,193 INFO L225 Difference]: With dead ends: 8067 [2019-10-03 03:02:20,194 INFO L226 Difference]: Without dead ends: 8067 [2019-10-03 03:02:20,195 INFO L640 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-10-03 03:02:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-10-03 03:02:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 7151. [2019-10-03 03:02:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-10-03 03:02:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 9773 transitions. [2019-10-03 03:02:20,367 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 9773 transitions. Word has length 60 [2019-10-03 03:02:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:20,368 INFO L475 AbstractCegarLoop]: Abstraction has 7151 states and 9773 transitions. [2019-10-03 03:02:20,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 9773 transitions. [2019-10-03 03:02:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:02:20,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:20,374 INFO L411 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-10-03 03:02:20,375 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:20,375 INFO L82 PathProgramCache]: Analyzing trace with hash -293371609, now seen corresponding path program 1 times [2019-10-03 03:02:20,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:20,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:20,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:20,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:20,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:20,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:20,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:20,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:20,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:20,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:20,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:20,534 INFO L87 Difference]: Start difference. First operand 7151 states and 9773 transitions. Second operand 3 states. [2019-10-03 03:02:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:20,789 INFO L93 Difference]: Finished difference Result 9721 states and 13722 transitions. [2019-10-03 03:02:20,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:20,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-03 03:02:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:20,813 INFO L225 Difference]: With dead ends: 9721 [2019-10-03 03:02:20,813 INFO L226 Difference]: Without dead ends: 9721 [2019-10-03 03:02:20,814 INFO L640 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-10-03 03:02:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9721 states. [2019-10-03 03:02:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9721 to 7854. [2019-10-03 03:02:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7854 states. [2019-10-03 03:02:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7854 states to 7854 states and 11004 transitions. [2019-10-03 03:02:20,944 INFO L78 Accepts]: Start accepts. Automaton has 7854 states and 11004 transitions. Word has length 61 [2019-10-03 03:02:20,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:20,945 INFO L475 AbstractCegarLoop]: Abstraction has 7854 states and 11004 transitions. [2019-10-03 03:02:20,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7854 states and 11004 transitions. [2019-10-03 03:02:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:02:20,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:20,950 INFO L411 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-10-03 03:02:20,951 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:20,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:20,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2069285283, now seen corresponding path program 1 times [2019-10-03 03:02:20,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:20,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:20,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:20,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:20,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:21,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:21,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:02:21,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:21,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:02:21,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:02:21,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:02:21,561 INFO L87 Difference]: Start difference. First operand 7854 states and 11004 transitions. Second operand 10 states. [2019-10-03 03:02:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:23,168 INFO L93 Difference]: Finished difference Result 29698 states and 42861 transitions. [2019-10-03 03:02:23,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:02:23,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-10-03 03:02:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:23,226 INFO L225 Difference]: With dead ends: 29698 [2019-10-03 03:02:23,226 INFO L226 Difference]: Without dead ends: 29698 [2019-10-03 03:02:23,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29698 states. [2019-10-03 03:02:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29698 to 7736. [2019-10-03 03:02:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7736 states. [2019-10-03 03:02:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7736 states to 7736 states and 10857 transitions. [2019-10-03 03:02:23,594 INFO L78 Accepts]: Start accepts. Automaton has 7736 states and 10857 transitions. Word has length 61 [2019-10-03 03:02:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:23,595 INFO L475 AbstractCegarLoop]: Abstraction has 7736 states and 10857 transitions. [2019-10-03 03:02:23,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:02:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 7736 states and 10857 transitions. [2019-10-03 03:02:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:02:23,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:23,598 INFO L411 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-10-03 03:02:23,598 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash -169233154, now seen corresponding path program 1 times [2019-10-03 03:02:23,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:23,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:23,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:23,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:23,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:23,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:23,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:23,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:23,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:23,686 INFO L87 Difference]: Start difference. First operand 7736 states and 10857 transitions. Second operand 3 states. [2019-10-03 03:02:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:23,786 INFO L93 Difference]: Finished difference Result 11823 states and 16958 transitions. [2019-10-03 03:02:23,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:23,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-03 03:02:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:23,810 INFO L225 Difference]: With dead ends: 11823 [2019-10-03 03:02:23,810 INFO L226 Difference]: Without dead ends: 11823 [2019-10-03 03:02:23,811 INFO L640 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-10-03 03:02:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2019-10-03 03:02:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 9317. [2019-10-03 03:02:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9317 states. [2019-10-03 03:02:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9317 states to 9317 states and 13301 transitions. [2019-10-03 03:02:23,979 INFO L78 Accepts]: Start accepts. Automaton has 9317 states and 13301 transitions. Word has length 61 [2019-10-03 03:02:23,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:23,979 INFO L475 AbstractCegarLoop]: Abstraction has 9317 states and 13301 transitions. [2019-10-03 03:02:23,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 9317 states and 13301 transitions. [2019-10-03 03:02:23,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:02:23,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:23,982 INFO L411 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-10-03 03:02:23,982 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:23,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:23,983 INFO L82 PathProgramCache]: Analyzing trace with hash 58994233, now seen corresponding path program 1 times [2019-10-03 03:02:23,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:24,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:24,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:24,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:24,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:24,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:24,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:24,067 INFO L87 Difference]: Start difference. First operand 9317 states and 13301 transitions. Second operand 3 states. [2019-10-03 03:02:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:24,198 INFO L93 Difference]: Finished difference Result 10779 states and 15447 transitions. [2019-10-03 03:02:24,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:24,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-03 03:02:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:24,215 INFO L225 Difference]: With dead ends: 10779 [2019-10-03 03:02:24,215 INFO L226 Difference]: Without dead ends: 10779 [2019-10-03 03:02:24,215 INFO L640 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-10-03 03:02:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10779 states. [2019-10-03 03:02:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10779 to 8552. [2019-10-03 03:02:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8552 states. [2019-10-03 03:02:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8552 states to 8552 states and 12300 transitions. [2019-10-03 03:02:24,336 INFO L78 Accepts]: Start accepts. Automaton has 8552 states and 12300 transitions. Word has length 61 [2019-10-03 03:02:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:24,337 INFO L475 AbstractCegarLoop]: Abstraction has 8552 states and 12300 transitions. [2019-10-03 03:02:24,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 8552 states and 12300 transitions. [2019-10-03 03:02:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 03:02:24,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:24,340 INFO L411 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] [2019-10-03 03:02:24,340 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash -244084559, now seen corresponding path program 1 times [2019-10-03 03:02:24,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:24,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:24,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:24,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:24,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:25,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:25,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:02:25,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:25,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:02:25,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:02:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:25,060 INFO L87 Difference]: Start difference. First operand 8552 states and 12300 transitions. Second operand 19 states. [2019-10-03 03:02:25,257 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-10-03 03:02:25,974 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-10-03 03:02:26,347 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-10-03 03:02:26,614 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-03 03:02:26,774 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-03 03:02:26,993 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-03 03:02:27,524 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-03 03:02:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:32,153 INFO L93 Difference]: Finished difference Result 32510 states and 47403 transitions. [2019-10-03 03:02:32,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:02:32,153 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2019-10-03 03:02:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:32,186 INFO L225 Difference]: With dead ends: 32510 [2019-10-03 03:02:32,186 INFO L226 Difference]: Without dead ends: 32510 [2019-10-03 03:02:32,187 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=302, Invalid=1338, Unknown=0, NotChecked=0, Total=1640 [2019-10-03 03:02:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32510 states. [2019-10-03 03:02:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32510 to 8565. [2019-10-03 03:02:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8565 states. [2019-10-03 03:02:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8565 states to 8565 states and 12318 transitions. [2019-10-03 03:02:32,536 INFO L78 Accepts]: Start accepts. Automaton has 8565 states and 12318 transitions. Word has length 62 [2019-10-03 03:02:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:32,536 INFO L475 AbstractCegarLoop]: Abstraction has 8565 states and 12318 transitions. [2019-10-03 03:02:32,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:02:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 8565 states and 12318 transitions. [2019-10-03 03:02:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 03:02:32,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:32,547 INFO L411 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] [2019-10-03 03:02:32,548 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:32,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:32,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1004192523, now seen corresponding path program 1 times [2019-10-03 03:02:32,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:32,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:32,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:32,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:32,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:33,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:33,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 03:02:33,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:33,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 03:02:33,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 03:02:33,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:02:33,128 INFO L87 Difference]: Start difference. First operand 8565 states and 12318 transitions. Second operand 14 states. [2019-10-03 03:02:35,210 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-03 03:02:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:37,396 INFO L93 Difference]: Finished difference Result 19021 states and 27370 transitions. [2019-10-03 03:02:37,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-03 03:02:37,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-10-03 03:02:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:37,414 INFO L225 Difference]: With dead ends: 19021 [2019-10-03 03:02:37,414 INFO L226 Difference]: Without dead ends: 19021 [2019-10-03 03:02:37,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=325, Invalid=797, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 03:02:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19021 states. [2019-10-03 03:02:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19021 to 8503. [2019-10-03 03:02:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8503 states. [2019-10-03 03:02:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8503 states to 8503 states and 12238 transitions. [2019-10-03 03:02:37,580 INFO L78 Accepts]: Start accepts. Automaton has 8503 states and 12238 transitions. Word has length 63 [2019-10-03 03:02:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:37,581 INFO L475 AbstractCegarLoop]: Abstraction has 8503 states and 12238 transitions. [2019-10-03 03:02:37,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 03:02:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 8503 states and 12238 transitions. [2019-10-03 03:02:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-03 03:02:37,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:37,584 INFO L411 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-10-03 03:02:37,585 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2123353110, now seen corresponding path program 1 times [2019-10-03 03:02:37,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:37,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:37,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:37,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:37,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:37,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:37,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:37,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:37,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:37,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:37,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:37,698 INFO L87 Difference]: Start difference. First operand 8503 states and 12238 transitions. Second operand 6 states. [2019-10-03 03:02:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:37,898 INFO L93 Difference]: Finished difference Result 29969 states and 42232 transitions. [2019-10-03 03:02:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:02:37,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-03 03:02:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:37,925 INFO L225 Difference]: With dead ends: 29969 [2019-10-03 03:02:37,925 INFO L226 Difference]: Without dead ends: 29969 [2019-10-03 03:02:37,926 INFO L640 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-10-03 03:02:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29969 states. [2019-10-03 03:02:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29969 to 26297. [2019-10-03 03:02:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26297 states. [2019-10-03 03:02:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26297 states to 26297 states and 37105 transitions. [2019-10-03 03:02:38,348 INFO L78 Accepts]: Start accepts. Automaton has 26297 states and 37105 transitions. Word has length 70 [2019-10-03 03:02:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:38,349 INFO L475 AbstractCegarLoop]: Abstraction has 26297 states and 37105 transitions. [2019-10-03 03:02:38,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 26297 states and 37105 transitions. [2019-10-03 03:02:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 03:02:38,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:38,353 INFO L411 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-10-03 03:02:38,354 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:38,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1078555367, now seen corresponding path program 1 times [2019-10-03 03:02:38,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:38,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:38,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:38,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:38,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:38,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:38,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:38,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:38,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:38,482 INFO L87 Difference]: Start difference. First operand 26297 states and 37105 transitions. Second operand 5 states. [2019-10-03 03:02:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:38,618 INFO L93 Difference]: Finished difference Result 20595 states and 28880 transitions. [2019-10-03 03:02:38,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:38,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-03 03:02:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:38,646 INFO L225 Difference]: With dead ends: 20595 [2019-10-03 03:02:38,646 INFO L226 Difference]: Without dead ends: 20595 [2019-10-03 03:02:38,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20595 states. [2019-10-03 03:02:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20595 to 20591. [2019-10-03 03:02:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20591 states. [2019-10-03 03:02:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20591 states to 20591 states and 28878 transitions. [2019-10-03 03:02:38,950 INFO L78 Accepts]: Start accepts. Automaton has 20591 states and 28878 transitions. Word has length 71 [2019-10-03 03:02:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:38,950 INFO L475 AbstractCegarLoop]: Abstraction has 20591 states and 28878 transitions. [2019-10-03 03:02:38,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 20591 states and 28878 transitions. [2019-10-03 03:02:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-03 03:02:38,955 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:38,955 INFO L411 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] [2019-10-03 03:02:38,956 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:38,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash 781945202, now seen corresponding path program 1 times [2019-10-03 03:02:38,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:38,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:38,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:38,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:39,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:39,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:39,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:39,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:39,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:39,067 INFO L87 Difference]: Start difference. First operand 20591 states and 28878 transitions. Second operand 6 states. [2019-10-03 03:02:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:39,278 INFO L93 Difference]: Finished difference Result 35790 states and 49246 transitions. [2019-10-03 03:02:39,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:39,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-03 03:02:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:39,319 INFO L225 Difference]: With dead ends: 35790 [2019-10-03 03:02:39,319 INFO L226 Difference]: Without dead ends: 35790 [2019-10-03 03:02:39,320 INFO L640 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-10-03 03:02:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35790 states. [2019-10-03 03:02:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35790 to 21257. [2019-10-03 03:02:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21257 states. [2019-10-03 03:02:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21257 states to 21257 states and 29387 transitions. [2019-10-03 03:02:39,620 INFO L78 Accepts]: Start accepts. Automaton has 21257 states and 29387 transitions. Word has length 73 [2019-10-03 03:02:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:39,620 INFO L475 AbstractCegarLoop]: Abstraction has 21257 states and 29387 transitions. [2019-10-03 03:02:39,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 21257 states and 29387 transitions. [2019-10-03 03:02:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 03:02:39,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:39,625 INFO L411 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-10-03 03:02:39,625 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:39,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:39,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1414482205, now seen corresponding path program 1 times [2019-10-03 03:02:39,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:39,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:39,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:39,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:40,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:40,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:40,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:40,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:40,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:40,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:40,600 INFO L87 Difference]: Start difference. First operand 21257 states and 29387 transitions. Second operand 3 states. [2019-10-03 03:02:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:40,734 INFO L93 Difference]: Finished difference Result 37259 states and 51080 transitions. [2019-10-03 03:02:40,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:40,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-03 03:02:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:40,780 INFO L225 Difference]: With dead ends: 37259 [2019-10-03 03:02:40,780 INFO L226 Difference]: Without dead ends: 37259 [2019-10-03 03:02:40,781 INFO L640 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-10-03 03:02:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37259 states. [2019-10-03 03:02:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37259 to 37257. [2019-10-03 03:02:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37257 states. [2019-10-03 03:02:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37257 states to 37257 states and 51079 transitions. [2019-10-03 03:02:41,238 INFO L78 Accepts]: Start accepts. Automaton has 37257 states and 51079 transitions. Word has length 74 [2019-10-03 03:02:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:41,238 INFO L475 AbstractCegarLoop]: Abstraction has 37257 states and 51079 transitions. [2019-10-03 03:02:41,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 37257 states and 51079 transitions. [2019-10-03 03:02:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 03:02:41,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:41,243 INFO L411 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] [2019-10-03 03:02:41,243 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:41,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1190739596, now seen corresponding path program 1 times [2019-10-03 03:02:41,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:41,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:41,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:41,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:41,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:41,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:41,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:41,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:41,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:41,333 INFO L87 Difference]: Start difference. First operand 37257 states and 51079 transitions. Second operand 5 states. [2019-10-03 03:02:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:42,141 INFO L93 Difference]: Finished difference Result 97056 states and 130925 transitions. [2019-10-03 03:02:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:42,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-03 03:02:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:42,238 INFO L225 Difference]: With dead ends: 97056 [2019-10-03 03:02:42,238 INFO L226 Difference]: Without dead ends: 97056 [2019-10-03 03:02:42,238 INFO L640 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-10-03 03:02:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97056 states. [2019-10-03 03:02:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97056 to 36828. [2019-10-03 03:02:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36828 states. [2019-10-03 03:02:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36828 states to 36828 states and 49856 transitions. [2019-10-03 03:02:43,062 INFO L78 Accepts]: Start accepts. Automaton has 36828 states and 49856 transitions. Word has length 76 [2019-10-03 03:02:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:43,063 INFO L475 AbstractCegarLoop]: Abstraction has 36828 states and 49856 transitions. [2019-10-03 03:02:43,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 36828 states and 49856 transitions. [2019-10-03 03:02:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 03:02:43,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:43,067 INFO L411 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-10-03 03:02:43,067 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2062750855, now seen corresponding path program 1 times [2019-10-03 03:02:43,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:43,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:43,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:43,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:43,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:43,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:43,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:43,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:43,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:43,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:43,147 INFO L87 Difference]: Start difference. First operand 36828 states and 49856 transitions. Second operand 3 states. [2019-10-03 03:02:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:43,252 INFO L93 Difference]: Finished difference Result 36830 states and 49220 transitions. [2019-10-03 03:02:43,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:43,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-03 03:02:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:43,290 INFO L225 Difference]: With dead ends: 36830 [2019-10-03 03:02:43,290 INFO L226 Difference]: Without dead ends: 36830 [2019-10-03 03:02:43,290 INFO L640 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-10-03 03:02:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36830 states. [2019-10-03 03:02:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36830 to 30282. [2019-10-03 03:02:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30282 states. [2019-10-03 03:02:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30282 states to 30282 states and 40584 transitions. [2019-10-03 03:02:43,552 INFO L78 Accepts]: Start accepts. Automaton has 30282 states and 40584 transitions. Word has length 77 [2019-10-03 03:02:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:43,552 INFO L475 AbstractCegarLoop]: Abstraction has 30282 states and 40584 transitions. [2019-10-03 03:02:43,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 30282 states and 40584 transitions. [2019-10-03 03:02:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-03 03:02:43,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:43,557 INFO L411 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] [2019-10-03 03:02:43,557 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash -667932309, now seen corresponding path program 1 times [2019-10-03 03:02:43,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:43,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:43,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:43,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:43,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:43,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:43,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:43,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:43,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:43,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:43,644 INFO L87 Difference]: Start difference. First operand 30282 states and 40584 transitions. Second operand 5 states. [2019-10-03 03:02:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:44,640 INFO L93 Difference]: Finished difference Result 97198 states and 128332 transitions. [2019-10-03 03:02:44,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:44,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-03 03:02:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:44,731 INFO L225 Difference]: With dead ends: 97198 [2019-10-03 03:02:44,731 INFO L226 Difference]: Without dead ends: 97198 [2019-10-03 03:02:44,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97198 states. [2019-10-03 03:02:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97198 to 50426. [2019-10-03 03:02:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50426 states. [2019-10-03 03:02:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50426 states to 50426 states and 67138 transitions. [2019-10-03 03:02:45,354 INFO L78 Accepts]: Start accepts. Automaton has 50426 states and 67138 transitions. Word has length 78 [2019-10-03 03:02:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:45,354 INFO L475 AbstractCegarLoop]: Abstraction has 50426 states and 67138 transitions. [2019-10-03 03:02:45,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 50426 states and 67138 transitions. [2019-10-03 03:02:45,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 03:02:45,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:45,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:45,357 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:45,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1157971312, now seen corresponding path program 1 times [2019-10-03 03:02:45,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:45,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:45,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:45,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:45,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:45,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:45,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:45,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:45,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:45,443 INFO L87 Difference]: Start difference. First operand 50426 states and 67138 transitions. Second operand 5 states. [2019-10-03 03:02:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:46,308 INFO L93 Difference]: Finished difference Result 155957 states and 203142 transitions. [2019-10-03 03:02:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:46,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-03 03:02:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:48,135 INFO L225 Difference]: With dead ends: 155957 [2019-10-03 03:02:48,136 INFO L226 Difference]: Without dead ends: 155957 [2019-10-03 03:02:48,136 INFO L640 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-10-03 03:02:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155957 states. [2019-10-03 03:02:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155957 to 101537. [2019-10-03 03:02:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101537 states. [2019-10-03 03:02:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101537 states to 101537 states and 134196 transitions. [2019-10-03 03:02:49,263 INFO L78 Accepts]: Start accepts. Automaton has 101537 states and 134196 transitions. Word has length 81 [2019-10-03 03:02:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:49,263 INFO L475 AbstractCegarLoop]: Abstraction has 101537 states and 134196 transitions. [2019-10-03 03:02:49,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 101537 states and 134196 transitions. [2019-10-03 03:02:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-03 03:02:49,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:49,267 INFO L411 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, 1] [2019-10-03 03:02:49,267 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:49,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:49,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2119187877, now seen corresponding path program 1 times [2019-10-03 03:02:49,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:49,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:49,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:49,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:49,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:49,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:49,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:49,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:49,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:49,364 INFO L87 Difference]: Start difference. First operand 101537 states and 134196 transitions. Second operand 3 states. [2019-10-03 03:02:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:49,930 INFO L93 Difference]: Finished difference Result 98952 states and 127782 transitions. [2019-10-03 03:02:49,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:49,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-03 03:02:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:50,036 INFO L225 Difference]: With dead ends: 98952 [2019-10-03 03:02:50,037 INFO L226 Difference]: Without dead ends: 98952 [2019-10-03 03:02:50,037 INFO L640 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-10-03 03:02:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98952 states. [2019-10-03 03:02:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98952 to 81560. [2019-10-03 03:02:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81560 states. [2019-10-03 03:02:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81560 states to 81560 states and 105730 transitions. [2019-10-03 03:02:50,866 INFO L78 Accepts]: Start accepts. Automaton has 81560 states and 105730 transitions. Word has length 83 [2019-10-03 03:02:50,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:50,866 INFO L475 AbstractCegarLoop]: Abstraction has 81560 states and 105730 transitions. [2019-10-03 03:02:50,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 81560 states and 105730 transitions. [2019-10-03 03:02:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-03 03:02:50,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:50,871 INFO L411 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, 1, 1, 1, 1] [2019-10-03 03:02:50,871 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:50,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:50,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1400576218, now seen corresponding path program 1 times [2019-10-03 03:02:50,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:50,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:50,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:50,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:50,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:50,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:50,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:50,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:50,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:50,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:50,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:50,957 INFO L87 Difference]: Start difference. First operand 81560 states and 105730 transitions. Second operand 3 states. [2019-10-03 03:02:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:51,194 INFO L93 Difference]: Finished difference Result 98386 states and 125788 transitions. [2019-10-03 03:02:51,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:51,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-03 03:02:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:51,302 INFO L225 Difference]: With dead ends: 98386 [2019-10-03 03:02:51,303 INFO L226 Difference]: Without dead ends: 98386 [2019-10-03 03:02:51,303 INFO L640 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-10-03 03:02:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98386 states. [2019-10-03 03:02:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98386 to 93889. [2019-10-03 03:02:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93889 states. [2019-10-03 03:02:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93889 states to 93889 states and 120482 transitions. [2019-10-03 03:02:52,477 INFO L78 Accepts]: Start accepts. Automaton has 93889 states and 120482 transitions. Word has length 86 [2019-10-03 03:02:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:52,478 INFO L475 AbstractCegarLoop]: Abstraction has 93889 states and 120482 transitions. [2019-10-03 03:02:52,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 93889 states and 120482 transitions. [2019-10-03 03:02:52,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:02:52,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:52,485 INFO L411 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, 1, 1, 1, 1] [2019-10-03 03:02:52,485 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:52,485 INFO L82 PathProgramCache]: Analyzing trace with hash 213751766, now seen corresponding path program 1 times [2019-10-03 03:02:52,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:52,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:52,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:52,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:52,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:02:52,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:52,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:52,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:52,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:52,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:52,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:52,572 INFO L87 Difference]: Start difference. First operand 93889 states and 120482 transitions. Second operand 3 states. [2019-10-03 03:02:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:52,965 INFO L93 Difference]: Finished difference Result 168729 states and 210997 transitions. [2019-10-03 03:02:52,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:52,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-03 03:02:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:53,150 INFO L225 Difference]: With dead ends: 168729 [2019-10-03 03:02:53,150 INFO L226 Difference]: Without dead ends: 168729 [2019-10-03 03:02:53,151 INFO L640 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-10-03 03:02:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168729 states. [2019-10-03 03:02:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168729 to 148920. [2019-10-03 03:02:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148920 states. [2019-10-03 03:02:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148920 states to 148920 states and 187364 transitions. [2019-10-03 03:02:55,151 INFO L78 Accepts]: Start accepts. Automaton has 148920 states and 187364 transitions. Word has length 94 [2019-10-03 03:02:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:55,152 INFO L475 AbstractCegarLoop]: Abstraction has 148920 states and 187364 transitions. [2019-10-03 03:02:55,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 148920 states and 187364 transitions. [2019-10-03 03:02:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 03:02:55,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:55,160 INFO L411 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-10-03 03:02:55,160 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:55,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:55,161 INFO L82 PathProgramCache]: Analyzing trace with hash -383116103, now seen corresponding path program 1 times [2019-10-03 03:02:55,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:55,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:55,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:55,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:55,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:55,291 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-10-03 03:02:55,293 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [168], [171], [172], [174], [177], [180], [201], [203], [205], [2186], [2189], [2210], [2212], [2214], [2216], [2219], [2240], [2242], [2244], [2247], [2250], [2252], [2257], [2262], [2264], [2283], [2285], [2304], [2634], [2638], [2641], [2644], [2647], [2655], [2657], [3711], [3725], [3727], [3731], [3734], [3737], [3740], [3744], [3896], [3943], [3946], [3949], [3953], [3956], [3959], [3963], [3965], [3968], [3972], [3975], [3984], [3986], [4283], [4286], [4289], [4293], [4296], [4300], [4304], [4318], [4320], [4929], [4930], [4934], [4935], [4936] [2019-10-03 03:02:55,341 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:02:55,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:02:55,634 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:02:56,183 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:02:56,186 INFO L272 AbstractInterpreter]: Visited 92 different actions 287 times. Merged at 28 different actions 178 times. Widened at 10 different actions 22 times. Performed 1597 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1597 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 14 fixpoints after 6 different actions. Largest state had 386 variables. [2019-10-03 03:02:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:56,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:02:56,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:56,192 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-10-03 03:02:56,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:56,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:02:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:57,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-03 03:02:57,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:57,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:57,559 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:57,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:57,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:57,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2019-10-03 03:02:57,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:57,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:02:57,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:02:57,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:02:57,865 INFO L87 Difference]: Start difference. First operand 148920 states and 187364 transitions. Second operand 13 states. [2019-10-03 03:03:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:03,335 INFO L93 Difference]: Finished difference Result 352591 states and 443019 transitions. [2019-10-03 03:03:03,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-03 03:03:03,335 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-10-03 03:03:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:04,184 INFO L225 Difference]: With dead ends: 352591 [2019-10-03 03:03:04,185 INFO L226 Difference]: Without dead ends: 352591 [2019-10-03 03:03:04,186 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=559, Invalid=1697, Unknown=0, NotChecked=0, Total=2256 [2019-10-03 03:03:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352591 states. [2019-10-03 03:03:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352591 to 193309. [2019-10-03 03:03:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193309 states. [2019-10-03 03:03:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193309 states to 193309 states and 243026 transitions. [2019-10-03 03:03:13,086 INFO L78 Accepts]: Start accepts. Automaton has 193309 states and 243026 transitions. Word has length 97 [2019-10-03 03:03:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:13,086 INFO L475 AbstractCegarLoop]: Abstraction has 193309 states and 243026 transitions. [2019-10-03 03:03:13,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:03:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 193309 states and 243026 transitions. [2019-10-03 03:03:13,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 03:03:13,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:13,096 INFO L411 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-10-03 03:03:13,096 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:13,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2107665468, now seen corresponding path program 1 times [2019-10-03 03:03:13,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:13,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:13,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:13,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:13,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:13,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:13,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:03:13,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:13,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:03:13,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:03:13,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:13,221 INFO L87 Difference]: Start difference. First operand 193309 states and 243026 transitions. Second operand 3 states. [2019-10-03 03:03:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:13,700 INFO L93 Difference]: Finished difference Result 146879 states and 182144 transitions. [2019-10-03 03:03:13,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:03:13,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-03 03:03:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:13,917 INFO L225 Difference]: With dead ends: 146879 [2019-10-03 03:03:13,917 INFO L226 Difference]: Without dead ends: 146879 [2019-10-03 03:03:13,917 INFO L640 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-10-03 03:03:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146879 states. [2019-10-03 03:03:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146879 to 146685. [2019-10-03 03:03:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146685 states. [2019-10-03 03:03:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146685 states to 146685 states and 181951 transitions. [2019-10-03 03:03:19,894 INFO L78 Accepts]: Start accepts. Automaton has 146685 states and 181951 transitions. Word has length 98 [2019-10-03 03:03:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:19,894 INFO L475 AbstractCegarLoop]: Abstraction has 146685 states and 181951 transitions. [2019-10-03 03:03:19,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 146685 states and 181951 transitions. [2019-10-03 03:03:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 03:03:19,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:19,902 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:19,902 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:19,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1350911043, now seen corresponding path program 1 times [2019-10-03 03:03:19,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:19,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:19,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:19,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:19,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:19,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:19,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:19,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:19,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:19,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:19,993 INFO L87 Difference]: Start difference. First operand 146685 states and 181951 transitions. Second operand 5 states. [2019-10-03 03:03:20,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:20,809 INFO L93 Difference]: Finished difference Result 171486 states and 210334 transitions. [2019-10-03 03:03:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:03:20,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-03 03:03:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:20,969 INFO L225 Difference]: With dead ends: 171486 [2019-10-03 03:03:20,970 INFO L226 Difference]: Without dead ends: 171486 [2019-10-03 03:03:20,970 INFO L640 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-10-03 03:03:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171486 states. [2019-10-03 03:03:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171486 to 142162. [2019-10-03 03:03:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142162 states. [2019-10-03 03:03:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142162 states to 142162 states and 174090 transitions. [2019-10-03 03:03:23,025 INFO L78 Accepts]: Start accepts. Automaton has 142162 states and 174090 transitions. Word has length 99 [2019-10-03 03:03:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:23,026 INFO L475 AbstractCegarLoop]: Abstraction has 142162 states and 174090 transitions. [2019-10-03 03:03:23,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 142162 states and 174090 transitions. [2019-10-03 03:03:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 03:03:23,033 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:23,033 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:23,033 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:23,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1499550427, now seen corresponding path program 1 times [2019-10-03 03:03:23,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:23,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:23,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:23,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 03:03:23,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:23,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:03:23,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:23,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:03:23,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:03:23,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:23,126 INFO L87 Difference]: Start difference. First operand 142162 states and 174090 transitions. Second operand 3 states. [2019-10-03 03:03:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:23,397 INFO L93 Difference]: Finished difference Result 142018 states and 172126 transitions. [2019-10-03 03:03:23,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:03:23,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-03 03:03:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:23,519 INFO L225 Difference]: With dead ends: 142018 [2019-10-03 03:03:23,520 INFO L226 Difference]: Without dead ends: 142018 [2019-10-03 03:03:23,520 INFO L640 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-10-03 03:03:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142018 states. [2019-10-03 03:03:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142018 to 108046. [2019-10-03 03:03:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108046 states. [2019-10-03 03:03:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108046 states to 108046 states and 131534 transitions. [2019-10-03 03:03:24,515 INFO L78 Accepts]: Start accepts. Automaton has 108046 states and 131534 transitions. Word has length 101 [2019-10-03 03:03:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:24,515 INFO L475 AbstractCegarLoop]: Abstraction has 108046 states and 131534 transitions. [2019-10-03 03:03:24,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 108046 states and 131534 transitions. [2019-10-03 03:03:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 03:03:24,521 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:24,521 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:24,521 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:24,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash 786221547, now seen corresponding path program 1 times [2019-10-03 03:03:24,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:24,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:24,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:24,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:27,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:27,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:27,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:27,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:27,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:27,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:27,208 INFO L87 Difference]: Start difference. First operand 108046 states and 131534 transitions. Second operand 5 states. [2019-10-03 03:03:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:27,579 INFO L93 Difference]: Finished difference Result 150412 states and 182711 transitions. [2019-10-03 03:03:27,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:27,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-03 03:03:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:27,725 INFO L225 Difference]: With dead ends: 150412 [2019-10-03 03:03:27,726 INFO L226 Difference]: Without dead ends: 150412 [2019-10-03 03:03:27,726 INFO L640 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-10-03 03:03:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150412 states. [2019-10-03 03:03:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150412 to 124167. [2019-10-03 03:03:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124167 states. [2019-10-03 03:03:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124167 states to 124167 states and 150810 transitions. [2019-10-03 03:03:28,798 INFO L78 Accepts]: Start accepts. Automaton has 124167 states and 150810 transitions. Word has length 104 [2019-10-03 03:03:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:28,799 INFO L475 AbstractCegarLoop]: Abstraction has 124167 states and 150810 transitions. [2019-10-03 03:03:28,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 124167 states and 150810 transitions. [2019-10-03 03:03:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 03:03:28,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:28,804 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:28,805 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash 260740551, now seen corresponding path program 1 times [2019-10-03 03:03:28,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:28,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:28,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:28,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:28,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 03:03:28,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:28,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:28,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:28,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:28,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:28,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:28,933 INFO L87 Difference]: Start difference. First operand 124167 states and 150810 transitions. Second operand 5 states. [2019-10-03 03:03:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:29,605 INFO L93 Difference]: Finished difference Result 163821 states and 198682 transitions. [2019-10-03 03:03:29,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:29,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-03 03:03:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:29,754 INFO L225 Difference]: With dead ends: 163821 [2019-10-03 03:03:29,754 INFO L226 Difference]: Without dead ends: 163821 [2019-10-03 03:03:29,755 INFO L640 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-10-03 03:03:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163821 states. [2019-10-03 03:03:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163821 to 142703. [2019-10-03 03:03:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142703 states. [2019-10-03 03:03:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142703 states to 142703 states and 173111 transitions. [2019-10-03 03:03:34,613 INFO L78 Accepts]: Start accepts. Automaton has 142703 states and 173111 transitions. Word has length 104 [2019-10-03 03:03:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:34,613 INFO L475 AbstractCegarLoop]: Abstraction has 142703 states and 173111 transitions. [2019-10-03 03:03:34,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 142703 states and 173111 transitions. [2019-10-03 03:03:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 03:03:34,620 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:34,620 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:34,620 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1962158497, now seen corresponding path program 1 times [2019-10-03 03:03:34,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:34,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:34,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:34,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:34,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 03:03:34,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:34,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:03:34,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:34,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:03:34,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:03:34,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:03:34,697 INFO L87 Difference]: Start difference. First operand 142703 states and 173111 transitions. Second operand 4 states. [2019-10-03 03:03:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:35,627 INFO L93 Difference]: Finished difference Result 268410 states and 326221 transitions. [2019-10-03 03:03:35,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:35,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-03 03:03:35,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:35,900 INFO L225 Difference]: With dead ends: 268410 [2019-10-03 03:03:35,900 INFO L226 Difference]: Without dead ends: 268410 [2019-10-03 03:03:35,900 INFO L640 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-10-03 03:03:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268410 states. [2019-10-03 03:03:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268410 to 169846. [2019-10-03 03:03:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169846 states. [2019-10-03 03:03:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169846 states to 169846 states and 206445 transitions. [2019-10-03 03:03:37,968 INFO L78 Accepts]: Start accepts. Automaton has 169846 states and 206445 transitions. Word has length 107 [2019-10-03 03:03:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:37,968 INFO L475 AbstractCegarLoop]: Abstraction has 169846 states and 206445 transitions. [2019-10-03 03:03:37,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:03:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 169846 states and 206445 transitions. [2019-10-03 03:03:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 03:03:37,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:37,976 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:37,976 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:37,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1420978006, now seen corresponding path program 1 times [2019-10-03 03:03:37,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:37,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:37,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:37,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:37,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:38,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:38,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:03:38,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:38,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:03:38,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:03:38,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:03:38,231 INFO L87 Difference]: Start difference. First operand 169846 states and 206445 transitions. Second operand 10 states. [2019-10-03 03:03:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:40,604 INFO L93 Difference]: Finished difference Result 300761 states and 362074 transitions. [2019-10-03 03:03:40,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-03 03:03:40,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2019-10-03 03:03:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:40,928 INFO L225 Difference]: With dead ends: 300761 [2019-10-03 03:03:40,928 INFO L226 Difference]: Without dead ends: 300761 [2019-10-03 03:03:40,929 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=540, Unknown=0, NotChecked=0, Total=756 [2019-10-03 03:03:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300761 states. [2019-10-03 03:03:44,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300761 to 225812. [2019-10-03 03:03:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225812 states. [2019-10-03 03:03:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225812 states to 225812 states and 273887 transitions. [2019-10-03 03:03:44,629 INFO L78 Accepts]: Start accepts. Automaton has 225812 states and 273887 transitions. Word has length 108 [2019-10-03 03:03:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:44,629 INFO L475 AbstractCegarLoop]: Abstraction has 225812 states and 273887 transitions. [2019-10-03 03:03:44,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:03:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 225812 states and 273887 transitions. [2019-10-03 03:03:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:03:44,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:44,638 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:44,639 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:44,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:44,639 INFO L82 PathProgramCache]: Analyzing trace with hash -499235246, now seen corresponding path program 1 times [2019-10-03 03:03:44,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:44,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:44,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:44,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:44,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:44,870 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-10-03 03:03:44,870 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [76], [79], [82], [85], [89], [168], [171], [172], [174], [177], [180], [183], [186], [191], [194], [203], [205], [380], [483], [486], [489], [493], [496], [499], [503], [505], [508], [511], [514], [519], [522], [525], [528], [532], [536], [969], [972], [975], [979], [982], [986], [989], [992], [995], [1003], [1005], [2186], [2189], [2210], [2212], [2214], [2216], [2219], [2240], [2242], [2244], [2247], [2250], [2260], [2262], [2264], [2283], [2285], [2288], [2291], [2294], [2302], [2306], [2309], [2312], [2315], [2323], [2325], [4929], [4930], [4934], [4935], [4936] [2019-10-03 03:03:44,879 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:44,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:45,011 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:45,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:45,654 INFO L272 AbstractInterpreter]: Visited 103 different actions 393 times. Merged at 39 different actions 264 times. Widened at 16 different actions 42 times. Performed 1889 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1889 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 9 different actions. Largest state had 387 variables. [2019-10-03 03:03:45,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:45,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:45,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:45,655 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:03:45,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:45,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:46,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 2048 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:03:46,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:46,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:46,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:47,012 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:47,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:47,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:03:47,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2019-10-03 03:03:47,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:03:47,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:03:47,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:03:47,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-10-03 03:03:47,359 INFO L87 Difference]: Start difference. First operand 225812 states and 273887 transitions. Second operand 18 states. [2019-10-03 03:03:47,818 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-03 03:03:47,973 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:03:54,107 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-10-03 03:03:54,764 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:03:57,001 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:03:57,482 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-03 03:03:57,645 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:03:58,706 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-03 03:03:59,594 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:04:00,237 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-03 03:04:00,550 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-03 03:04:01,168 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-10-03 03:04:02,061 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:04:02,556 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-10-03 03:04:03,311 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:04:04,204 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-10-03 03:04:04,511 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:04:05,289 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-10-03 03:04:05,673 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-03 03:04:06,574 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-10-03 03:04:06,860 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-03 03:04:08,695 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-10-03 03:04:09,116 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-03 03:04:09,582 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-10-03 03:04:09,824 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-10-03 03:04:10,556 WARN L191 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:04:11,060 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-03 03:04:11,609 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:04:12,168 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-10-03 03:04:13,072 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-10-03 03:04:13,994 WARN L191 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-10-03 03:04:15,096 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-10-03 03:04:15,259 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-03 03:04:15,688 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:04:16,546 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-03 03:04:17,439 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-03 03:04:17,674 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-10-03 03:04:18,205 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-03 03:04:19,390 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-03 03:04:19,825 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-10-03 03:04:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:20,761 INFO L93 Difference]: Finished difference Result 583120 states and 701547 transitions. [2019-10-03 03:04:20,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-03 03:04:20,762 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 109 [2019-10-03 03:04:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:22,586 INFO L225 Difference]: With dead ends: 583120 [2019-10-03 03:04:22,586 INFO L226 Difference]: Without dead ends: 583120 [2019-10-03 03:04:22,589 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 191 SyntacticMatches, 12 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3819 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=2055, Invalid=10377, Unknown=0, NotChecked=0, Total=12432 [2019-10-03 03:04:22,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583120 states. [2019-10-03 03:04:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583120 to 233263. [2019-10-03 03:04:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233263 states. [2019-10-03 03:04:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233263 states to 233263 states and 282699 transitions. [2019-10-03 03:04:28,381 INFO L78 Accepts]: Start accepts. Automaton has 233263 states and 282699 transitions. Word has length 109 [2019-10-03 03:04:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:28,382 INFO L475 AbstractCegarLoop]: Abstraction has 233263 states and 282699 transitions. [2019-10-03 03:04:28,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:04:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 233263 states and 282699 transitions. [2019-10-03 03:04:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:04:28,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:28,394 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:28,395 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1995238919, now seen corresponding path program 1 times [2019-10-03 03:04:28,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:28,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:28,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:28,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:28,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:28,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:28,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:28,708 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-10-03 03:04:28,709 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [168], [171], [172], [174], [177], [180], [183], [199], [203], [205], [2186], [2189], [2192], [2195], [2200], [2203], [2212], [2214], [2216], [2219], [2240], [2242], [2244], [2247], [2250], [2260], [2262], [2264], [2267], [2270], [2273], [2281], [2283], [2306], [2309], [2312], [2315], [2323], [2325], [3711], [3725], [3727], [3731], [3734], [3737], [3740], [3744], [3747], [3750], [3753], [3756], [3759], [3763], [3766], [3769], [3772], [3776], [3780], [3809], [3812], [3816], [3819], [3822], [3825], [3830], [3833], [3836], [3839], [3843], [3846], [3850], [3854], [3857], [3860], [3863], [3871], [3875], [4929], [4930], [4934], [4935], [4936] [2019-10-03 03:04:28,718 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:28,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:28,819 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:29,259 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:29,260 INFO L272 AbstractInterpreter]: Visited 103 different actions 373 times. Merged at 39 different actions 247 times. Widened at 14 different actions 32 times. Performed 1847 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1847 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 11 different actions. Largest state had 387 variables. [2019-10-03 03:04:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:29,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:29,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:29,260 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-10-03 03:04:29,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:29,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:29,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-03 03:04:29,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:30,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:34,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:34,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:34,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:34,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:41,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:04:41,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 26 [2019-10-03 03:04:41,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:04:41,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:04:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:04:41,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-10-03 03:04:41,027 INFO L87 Difference]: Start difference. First operand 233263 states and 282699 transitions. Second operand 19 states. [2019-10-03 03:04:41,508 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:04:41,756 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-03 03:04:42,272 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-03 03:04:42,702 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:04:42,956 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-03 03:04:43,510 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-10-03 03:04:43,835 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-03 03:04:44,239 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-10-03 03:04:45,221 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-03 03:04:46,472 WARN L191 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-03 03:04:46,656 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-10-03 03:04:47,563 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-10-03 03:04:47,755 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-10-03 03:04:48,073 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-03 03:04:50,065 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-03 03:04:50,559 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-03 03:04:51,051 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-10-03 03:04:51,219 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:04:51,394 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-03 03:04:51,540 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-10-03 03:04:51,925 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-03 03:04:52,085 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-03 03:04:52,293 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-10-03 03:04:52,680 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:04:52,872 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-10-03 03:04:53,079 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-03 03:04:53,364 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-10-03 03:04:53,708 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-10-03 03:04:54,281 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:04:54,940 WARN L191 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-03 03:04:55,168 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-03 03:04:55,763 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:04:56,196 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:04:56,541 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:04:57,263 WARN L191 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:04:57,828 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-03 03:04:58,421 WARN L191 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:04:58,998 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-03 03:04:59,372 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:04:59,784 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:05:00,026 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:05:00,595 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-03 03:05:00,984 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:05:01,479 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-03 03:05:02,028 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:05:02,548 WARN L191 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:05:02,850 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-10-03 03:05:03,227 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-03 03:05:03,675 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:05:04,275 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:05:04,546 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-03 03:05:04,875 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:05:05,342 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:05:05,671 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:05:06,372 WARN L191 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-03 03:05:06,909 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-03 03:05:07,152 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:05:07,520 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-03 03:05:07,925 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-03 03:05:08,209 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-03 03:05:08,582 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:05:08,987 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:05:09,340 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-03 03:05:09,731 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:05:10,174 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:05:10,633 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:05:11,209 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:05:11,532 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:05:12,176 WARN L191 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:05:12,663 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-03 03:05:13,091 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:05:13,411 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-03 03:05:13,818 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-03 03:05:14,374 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:05:15,105 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:05:15,526 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:05:15,983 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:05:16,801 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-10-03 03:05:17,349 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:05:17,946 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:05:18,551 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-10-03 03:05:19,317 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:05:19,788 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-10-03 03:05:20,129 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-10-03 03:05:20,353 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-10-03 03:05:20,906 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-03 03:05:21,409 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:05:21,730 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:05:22,314 WARN L191 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:05:22,701 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-03 03:05:23,299 WARN L191 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-10-03 03:05:23,848 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:05:24,670 WARN L191 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:05:25,004 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-10-03 03:05:25,408 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-10-03 03:05:25,854 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-03 03:05:26,469 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-10-03 03:05:27,017 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-03 03:05:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:27,925 INFO L93 Difference]: Finished difference Result 499301 states and 595022 transitions. [2019-10-03 03:05:27,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-10-03 03:05:27,926 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2019-10-03 03:05:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:27,926 INFO L225 Difference]: With dead ends: 499301 [2019-10-03 03:05:27,926 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 03:05:27,930 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 234 SyntacticMatches, 20 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5524 ImplicationChecksByTransitivity, 47.0s TimeCoverageRelationStatistics Valid=3496, Invalid=12760, Unknown=0, NotChecked=0, Total=16256 [2019-10-03 03:05:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 03:05:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 03:05:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 03:05:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 03:05:27,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2019-10-03 03:05:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:27,930 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 03:05:27,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:05:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 03:05:27,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 03:05:27,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:05:27 BoogieIcfgContainer [2019-10-03 03:05:27,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 03:05:27,936 INFO L168 Benchmark]: Toolchain (without parser) took 210819.78 ms. Allocated memory was 141.0 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 81.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-10-03 03:05:27,937 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-03 03:05:27,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1704.09 ms. Allocated memory was 141.0 MB in the beginning and 232.3 MB in the end (delta: 91.2 MB). Free memory was 81.7 MB in the beginning and 126.6 MB in the end (delta: -44.9 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. [2019-10-03 03:05:27,938 INFO L168 Benchmark]: Boogie Preprocessor took 251.91 ms. Allocated memory is still 232.3 MB. Free memory was 126.6 MB in the beginning and 111.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2019-10-03 03:05:27,938 INFO L168 Benchmark]: RCFGBuilder took 3565.88 ms. Allocated memory was 232.3 MB in the beginning and 337.6 MB in the end (delta: 105.4 MB). Free memory was 111.6 MB in the beginning and 131.5 MB in the end (delta: -19.9 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. [2019-10-03 03:05:27,939 INFO L168 Benchmark]: TraceAbstraction took 205293.09 ms. Allocated memory was 337.6 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 131.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-03 03:05:27,943 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1704.09 ms. Allocated memory was 141.0 MB in the beginning and 232.3 MB in the end (delta: 91.2 MB). Free memory was 81.7 MB in the beginning and 126.6 MB in the end (delta: -44.9 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 251.91 ms. Allocated memory is still 232.3 MB. Free memory was 126.6 MB in the beginning and 111.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3565.88 ms. Allocated memory was 232.3 MB in the beginning and 337.6 MB in the end (delta: 105.4 MB). Free memory was 111.6 MB in the beginning and 131.5 MB in the end (delta: -19.9 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205293.09 ms. Allocated memory was 337.6 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 131.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1406]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1954]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3604]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5975]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 434]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 792]: 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, 1295 locations, 6 error locations. SAFE Result, 205.2s OverallTime, 36 OverallIterations, 2 TraceHistogramMax, 130.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22974 SDtfs, 78685 SDslu, 53098 SDs, 0 SdLazy, 35500 SolverSat, 2377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1268 GetRequests, 683 SyntacticMatches, 32 SemanticMatches, 553 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10914 ImplicationChecksByTransitivity, 76.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233263occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 46.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 1100864 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 3110 NumberOfCodeBlocks, 3110 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3383 ConstructedInterpolants, 107 QuantifiedInterpolants, 2646434 SizeOfPredicates, 26 NumberOfNonLiveVariables, 6116 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 42 InterpolantComputations, 33 PerfectInterpolantSequences, 119/158 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...