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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:48,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:48,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:48,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:48,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:48,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:48,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:48,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:48,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:48,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:48,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:48,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:48,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:48,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:48,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:48,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:48,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:48,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:48,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:48,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:48,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:48,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:48,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:48,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:48,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:48,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:48,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:48,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:48,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:48,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:48,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:48,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:48,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:48,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:48,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:48,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:48,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:48,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:48,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:48,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:48,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:48,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:23:48,102 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:48,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:48,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:48,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:48,104 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:48,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:48,104 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:48,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:48,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:48,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:48,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:48,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:48,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:48,105 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:48,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:48,106 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:48,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:48,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:48,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:48,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:48,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:48,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:48,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:48,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:48,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:48,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:48,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:48,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:48,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:23:48,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:48,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:48,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:48,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:48,416 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:48,417 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:23:48,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4639e77a4/2cf8adec69714a7fbf93111b9d1206bb/FLAGfc9cffa4d [2019-10-15 01:23:49,055 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:49,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:23:49,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4639e77a4/2cf8adec69714a7fbf93111b9d1206bb/FLAGfc9cffa4d [2019-10-15 01:23:49,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4639e77a4/2cf8adec69714a7fbf93111b9d1206bb [2019-10-15 01:23:49,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:49,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:49,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:49,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:49,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:49,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:49" (1/1) ... [2019-10-15 01:23:49,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afc9091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49, skipping insertion in model container [2019-10-15 01:23:49,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:49" (1/1) ... [2019-10-15 01:23:49,403 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:49,499 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:50,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:50,128 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:50,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:50,609 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:50,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:50 WrapperNode [2019-10-15 01:23:50,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:50,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:50,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:50,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:50,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:50" (1/1) ... [2019-10-15 01:23:50,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:50" (1/1) ... [2019-10-15 01:23:50,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:50" (1/1) ... [2019-10-15 01:23:50,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:50" (1/1) ... [2019-10-15 01:23:50,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:50" (1/1) ... [2019-10-15 01:23:50,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:50" (1/1) ... [2019-10-15 01:23:50,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:50" (1/1) ... [2019-10-15 01:23:50,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:50,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:50,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:50,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:50,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:50" (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-15 01:23:50,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:50,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:50,859 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:50,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:50,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:50,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:50,861 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:50,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:50,861 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:50,862 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:50,862 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:50,862 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:50,862 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:50,863 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:50,864 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:50,864 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:50,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:50,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:52,597 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:52,597 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:52,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:52 BoogieIcfgContainer [2019-10-15 01:23:52,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:52,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:52,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:52,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:52,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:49" (1/3) ... [2019-10-15 01:23:52,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc12c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:52, skipping insertion in model container [2019-10-15 01:23:52,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:50" (2/3) ... [2019-10-15 01:23:52,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc12c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:52, skipping insertion in model container [2019-10-15 01:23:52,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:52" (3/3) ... [2019-10-15 01:23:52,609 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:23:52,619 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:52,629 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-15 01:23:52,641 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-15 01:23:52,673 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:52,673 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:52,674 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:52,674 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:52,674 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:52,674 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:52,674 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:52,674 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states. [2019-10-15 01:23:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:23:52,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:52,724 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:23:52,726 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:52,734 INFO L82 PathProgramCache]: Analyzing trace with hash 18427047, now seen corresponding path program 1 times [2019-10-15 01:23:52,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:52,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212211926] [2019-10-15 01:23:52,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:53,406 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-15 01:23:53,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212211926] [2019-10-15 01:23:53,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:53,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:53,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631324049] [2019-10-15 01:23:53,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:53,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:53,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:53,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,429 INFO L87 Difference]: Start difference. First operand 405 states. Second operand 3 states. [2019-10-15 01:23:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:53,656 INFO L93 Difference]: Finished difference Result 734 states and 1290 transitions. [2019-10-15 01:23:53,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:53,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:23:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:53,679 INFO L225 Difference]: With dead ends: 734 [2019-10-15 01:23:53,680 INFO L226 Difference]: Without dead ends: 573 [2019-10-15 01:23:53,685 INFO L600 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-15 01:23:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-10-15 01:23:53,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 571. [2019-10-15 01:23:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:23:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 834 transitions. [2019-10-15 01:23:53,783 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 834 transitions. Word has length 149 [2019-10-15 01:23:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:53,784 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 834 transitions. [2019-10-15 01:23:53,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 834 transitions. [2019-10-15 01:23:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:23:53,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:53,792 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:23:53,793 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:53,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash 108834247, now seen corresponding path program 1 times [2019-10-15 01:23:53,793 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:53,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983724084] [2019-10-15 01:23:53,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:54,078 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-15 01:23:54,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983724084] [2019-10-15 01:23:54,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:54,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:54,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294518302] [2019-10-15 01:23:54,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:54,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:54,084 INFO L87 Difference]: Start difference. First operand 571 states and 834 transitions. Second operand 3 states. [2019-10-15 01:23:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:54,340 INFO L93 Difference]: Finished difference Result 1144 states and 1727 transitions. [2019-10-15 01:23:54,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:54,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:23:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:54,358 INFO L225 Difference]: With dead ends: 1144 [2019-10-15 01:23:54,358 INFO L226 Difference]: Without dead ends: 915 [2019-10-15 01:23:54,368 INFO L600 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-15 01:23:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-10-15 01:23:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2019-10-15 01:23:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-15 01:23:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1356 transitions. [2019-10-15 01:23:54,458 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1356 transitions. Word has length 149 [2019-10-15 01:23:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:54,459 INFO L462 AbstractCegarLoop]: Abstraction has 913 states and 1356 transitions. [2019-10-15 01:23:54,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1356 transitions. [2019-10-15 01:23:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:23:54,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:54,463 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:23:54,464 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1956442329, now seen corresponding path program 1 times [2019-10-15 01:23:54,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:54,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493922154] [2019-10-15 01:23:54,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:54,940 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-15 01:23:54,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493922154] [2019-10-15 01:23:54,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:54,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:54,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082517641] [2019-10-15 01:23:54,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:54,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:54,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:54,943 INFO L87 Difference]: Start difference. First operand 913 states and 1356 transitions. Second operand 4 states. [2019-10-15 01:23:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:55,109 INFO L93 Difference]: Finished difference Result 2677 states and 3967 transitions. [2019-10-15 01:23:55,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:55,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-15 01:23:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:55,121 INFO L225 Difference]: With dead ends: 2677 [2019-10-15 01:23:55,121 INFO L226 Difference]: Without dead ends: 1777 [2019-10-15 01:23:55,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2019-10-15 01:23:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1748. [2019-10-15 01:23:55,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2019-10-15 01:23:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2584 transitions. [2019-10-15 01:23:55,238 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2584 transitions. Word has length 149 [2019-10-15 01:23:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,238 INFO L462 AbstractCegarLoop]: Abstraction has 1748 states and 2584 transitions. [2019-10-15 01:23:55,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2584 transitions. [2019-10-15 01:23:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:23:55,242 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,242 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:23:55,243 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,243 INFO L82 PathProgramCache]: Analyzing trace with hash 970634365, now seen corresponding path program 1 times [2019-10-15 01:23:55,244 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390567234] [2019-10-15 01:23:55,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:55,312 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-15 01:23:55,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390567234] [2019-10-15 01:23:55,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:55,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:55,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139802425] [2019-10-15 01:23:55,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:55,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:55,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:55,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:55,315 INFO L87 Difference]: Start difference. First operand 1748 states and 2584 transitions. Second operand 3 states. [2019-10-15 01:23:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:55,469 INFO L93 Difference]: Finished difference Result 5198 states and 7682 transitions. [2019-10-15 01:23:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:55,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-15 01:23:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:55,489 INFO L225 Difference]: With dead ends: 5198 [2019-10-15 01:23:55,489 INFO L226 Difference]: Without dead ends: 3482 [2019-10-15 01:23:55,494 INFO L600 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-15 01:23:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2019-10-15 01:23:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 1750. [2019-10-15 01:23:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-10-15 01:23:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2586 transitions. [2019-10-15 01:23:55,610 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2586 transitions. Word has length 150 [2019-10-15 01:23:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,611 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 2586 transitions. [2019-10-15 01:23:55,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2586 transitions. [2019-10-15 01:23:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:23:55,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,615 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:23:55,615 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1963532230, now seen corresponding path program 1 times [2019-10-15 01:23:55,616 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891790036] [2019-10-15 01:23:55,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:55,842 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-15 01:23:55,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891790036] [2019-10-15 01:23:55,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:55,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:55,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869049487] [2019-10-15 01:23:55,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:55,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:55,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:55,846 INFO L87 Difference]: Start difference. First operand 1750 states and 2586 transitions. Second operand 4 states. [2019-10-15 01:23:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:56,003 INFO L93 Difference]: Finished difference Result 3482 states and 5147 transitions. [2019-10-15 01:23:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:56,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-15 01:23:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:56,013 INFO L225 Difference]: With dead ends: 3482 [2019-10-15 01:23:56,013 INFO L226 Difference]: Without dead ends: 1750 [2019-10-15 01:23:56,017 INFO L600 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-15 01:23:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-10-15 01:23:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1749. [2019-10-15 01:23:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2019-10-15 01:23:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2583 transitions. [2019-10-15 01:23:56,103 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2583 transitions. Word has length 151 [2019-10-15 01:23:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:56,104 INFO L462 AbstractCegarLoop]: Abstraction has 1749 states and 2583 transitions. [2019-10-15 01:23:56,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2583 transitions. [2019-10-15 01:23:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:23:56,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:56,109 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:23:56,109 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:56,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:56,109 INFO L82 PathProgramCache]: Analyzing trace with hash 858257964, now seen corresponding path program 1 times [2019-10-15 01:23:56,110 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:56,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765226006] [2019-10-15 01:23:56,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:56,245 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-15 01:23:56,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765226006] [2019-10-15 01:23:56,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:56,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:56,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461191186] [2019-10-15 01:23:56,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:56,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:56,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:56,250 INFO L87 Difference]: Start difference. First operand 1749 states and 2583 transitions. Second operand 3 states. [2019-10-15 01:23:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:56,425 INFO L93 Difference]: Finished difference Result 4577 states and 6755 transitions. [2019-10-15 01:23:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:56,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-15 01:23:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:56,440 INFO L225 Difference]: With dead ends: 4577 [2019-10-15 01:23:56,441 INFO L226 Difference]: Without dead ends: 3026 [2019-10-15 01:23:56,445 INFO L600 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-15 01:23:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2019-10-15 01:23:56,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2997. [2019-10-15 01:23:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2997 states. [2019-10-15 01:23:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 4373 transitions. [2019-10-15 01:23:56,647 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 4373 transitions. Word has length 151 [2019-10-15 01:23:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:56,648 INFO L462 AbstractCegarLoop]: Abstraction has 2997 states and 4373 transitions. [2019-10-15 01:23:56,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 4373 transitions. [2019-10-15 01:23:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:23:56,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:56,657 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:23:56,658 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:56,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:56,658 INFO L82 PathProgramCache]: Analyzing trace with hash -649393937, now seen corresponding path program 1 times [2019-10-15 01:23:56,658 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:56,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233018244] [2019-10-15 01:23:56,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:56,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:56,933 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-15 01:23:56,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233018244] [2019-10-15 01:23:56,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:56,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:56,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886053690] [2019-10-15 01:23:56,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:56,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:56,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:56,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:56,937 INFO L87 Difference]: Start difference. First operand 2997 states and 4373 transitions. Second operand 4 states. [2019-10-15 01:23:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:57,082 INFO L93 Difference]: Finished difference Result 5374 states and 7862 transitions. [2019-10-15 01:23:57,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:57,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-15 01:23:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:57,095 INFO L225 Difference]: With dead ends: 5374 [2019-10-15 01:23:57,095 INFO L226 Difference]: Without dead ends: 2563 [2019-10-15 01:23:57,101 INFO L600 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-15 01:23:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2019-10-15 01:23:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2563. [2019-10-15 01:23:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2019-10-15 01:23:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3737 transitions. [2019-10-15 01:23:57,229 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3737 transitions. Word has length 151 [2019-10-15 01:23:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:57,230 INFO L462 AbstractCegarLoop]: Abstraction has 2563 states and 3737 transitions. [2019-10-15 01:23:57,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3737 transitions. [2019-10-15 01:23:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:23:57,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:57,234 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:23:57,235 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash -341408988, now seen corresponding path program 1 times [2019-10-15 01:23:57,236 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:57,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038246618] [2019-10-15 01:23:57,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:57,315 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-15 01:23:57,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038246618] [2019-10-15 01:23:57,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:57,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:57,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955781234] [2019-10-15 01:23:57,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:57,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:57,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:57,317 INFO L87 Difference]: Start difference. First operand 2563 states and 3737 transitions. Second operand 3 states. [2019-10-15 01:23:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:57,578 INFO L93 Difference]: Finished difference Result 5831 states and 8728 transitions. [2019-10-15 01:23:57,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:57,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-15 01:23:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:57,600 INFO L225 Difference]: With dead ends: 5831 [2019-10-15 01:23:57,600 INFO L226 Difference]: Without dead ends: 3457 [2019-10-15 01:23:57,606 INFO L600 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-15 01:23:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2019-10-15 01:23:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3395. [2019-10-15 01:23:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3395 states. [2019-10-15 01:23:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 5094 transitions. [2019-10-15 01:23:57,843 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 5094 transitions. Word has length 152 [2019-10-15 01:23:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:57,843 INFO L462 AbstractCegarLoop]: Abstraction has 3395 states and 5094 transitions. [2019-10-15 01:23:57,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 5094 transitions. [2019-10-15 01:23:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:23:57,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:57,855 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:23:57,855 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:57,856 INFO L82 PathProgramCache]: Analyzing trace with hash 35518099, now seen corresponding path program 1 times [2019-10-15 01:23:57,856 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:57,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009061030] [2019-10-15 01:23:57,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:57,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:58,457 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-15 01:23:58,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009061030] [2019-10-15 01:23:58,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:58,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:23:58,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27172268] [2019-10-15 01:23:58,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:23:58,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:58,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:23:58,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:23:58,465 INFO L87 Difference]: Start difference. First operand 3395 states and 5094 transitions. Second operand 13 states. [2019-10-15 01:24:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:02,990 INFO L93 Difference]: Finished difference Result 16024 states and 24982 transitions. [2019-10-15 01:24:02,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 01:24:02,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2019-10-15 01:24:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:03,043 INFO L225 Difference]: With dead ends: 16024 [2019-10-15 01:24:03,043 INFO L226 Difference]: Without dead ends: 12851 [2019-10-15 01:24:03,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 01:24:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12851 states. [2019-10-15 01:24:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12851 to 7992. [2019-10-15 01:24:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7992 states. [2019-10-15 01:24:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7992 states to 7992 states and 12283 transitions. [2019-10-15 01:24:03,539 INFO L78 Accepts]: Start accepts. Automaton has 7992 states and 12283 transitions. Word has length 155 [2019-10-15 01:24:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:03,540 INFO L462 AbstractCegarLoop]: Abstraction has 7992 states and 12283 transitions. [2019-10-15 01:24:03,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:24:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 7992 states and 12283 transitions. [2019-10-15 01:24:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:24:03,547 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:03,547 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:24:03,548 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:03,548 INFO L82 PathProgramCache]: Analyzing trace with hash -616025582, now seen corresponding path program 1 times [2019-10-15 01:24:03,548 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:03,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499933410] [2019-10-15 01:24:03,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:03,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:03,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:03,814 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-15 01:24:03,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499933410] [2019-10-15 01:24:03,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:03,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:03,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082460999] [2019-10-15 01:24:03,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:03,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:03,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:03,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:03,817 INFO L87 Difference]: Start difference. First operand 7992 states and 12283 transitions. Second operand 5 states. [2019-10-15 01:24:04,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:04,269 INFO L93 Difference]: Finished difference Result 11513 states and 17844 transitions. [2019-10-15 01:24:04,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:04,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-15 01:24:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:04,280 INFO L225 Difference]: With dead ends: 11513 [2019-10-15 01:24:04,280 INFO L226 Difference]: Without dead ends: 4406 [2019-10-15 01:24:04,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2019-10-15 01:24:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 3395. [2019-10-15 01:24:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3395 states. [2019-10-15 01:24:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 5079 transitions. [2019-10-15 01:24:04,457 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 5079 transitions. Word has length 155 [2019-10-15 01:24:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:04,457 INFO L462 AbstractCegarLoop]: Abstraction has 3395 states and 5079 transitions. [2019-10-15 01:24:04,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 5079 transitions. [2019-10-15 01:24:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:24:04,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:04,462 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:24:04,463 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash 917941838, now seen corresponding path program 1 times [2019-10-15 01:24:04,463 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:04,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087241185] [2019-10-15 01:24:04,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:04,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:04,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:04,688 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-15 01:24:04,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087241185] [2019-10-15 01:24:04,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:04,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:04,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216602618] [2019-10-15 01:24:04,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:04,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:04,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:04,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:04,691 INFO L87 Difference]: Start difference. First operand 3395 states and 5079 transitions. Second operand 9 states. [2019-10-15 01:24:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:06,274 INFO L93 Difference]: Finished difference Result 13649 states and 21233 transitions. [2019-10-15 01:24:06,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:24:06,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-10-15 01:24:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:06,297 INFO L225 Difference]: With dead ends: 13649 [2019-10-15 01:24:06,297 INFO L226 Difference]: Without dead ends: 10476 [2019-10-15 01:24:06,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:24:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10476 states. [2019-10-15 01:24:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10476 to 6314. [2019-10-15 01:24:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6314 states. [2019-10-15 01:24:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6314 states to 6314 states and 9620 transitions. [2019-10-15 01:24:06,826 INFO L78 Accepts]: Start accepts. Automaton has 6314 states and 9620 transitions. Word has length 155 [2019-10-15 01:24:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:06,827 INFO L462 AbstractCegarLoop]: Abstraction has 6314 states and 9620 transitions. [2019-10-15 01:24:06,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:06,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6314 states and 9620 transitions. [2019-10-15 01:24:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:24:06,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:06,832 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:24:06,832 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:06,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:06,833 INFO L82 PathProgramCache]: Analyzing trace with hash 266398157, now seen corresponding path program 1 times [2019-10-15 01:24:06,833 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:06,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507688126] [2019-10-15 01:24:06,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:07,021 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-15 01:24:07,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507688126] [2019-10-15 01:24:07,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:07,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:07,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126805885] [2019-10-15 01:24:07,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:07,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:07,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:07,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:07,023 INFO L87 Difference]: Start difference. First operand 6314 states and 9620 transitions. Second operand 4 states. [2019-10-15 01:24:07,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:07,541 INFO L93 Difference]: Finished difference Result 16559 states and 25207 transitions. [2019-10-15 01:24:07,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:07,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-15 01:24:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:07,561 INFO L225 Difference]: With dead ends: 16559 [2019-10-15 01:24:07,561 INFO L226 Difference]: Without dead ends: 10276 [2019-10-15 01:24:07,572 INFO L600 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-15 01:24:07,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10276 states. [2019-10-15 01:24:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10276 to 10253. [2019-10-15 01:24:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10253 states. [2019-10-15 01:24:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10253 states to 10253 states and 15452 transitions. [2019-10-15 01:24:08,370 INFO L78 Accepts]: Start accepts. Automaton has 10253 states and 15452 transitions. Word has length 155 [2019-10-15 01:24:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:08,370 INFO L462 AbstractCegarLoop]: Abstraction has 10253 states and 15452 transitions. [2019-10-15 01:24:08,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 10253 states and 15452 transitions. [2019-10-15 01:24:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 01:24:08,377 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:08,377 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:24:08,378 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:08,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash -800612128, now seen corresponding path program 1 times [2019-10-15 01:24:08,378 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:08,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028287739] [2019-10-15 01:24:08,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:08,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:08,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:08,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-15 01:24:08,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028287739] [2019-10-15 01:24:08,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:08,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:08,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687975538] [2019-10-15 01:24:08,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:08,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:08,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:08,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:08,484 INFO L87 Difference]: Start difference. First operand 10253 states and 15452 transitions. Second operand 3 states. [2019-10-15 01:24:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:09,583 INFO L93 Difference]: Finished difference Result 25879 states and 39071 transitions. [2019-10-15 01:24:09,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:09,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-15 01:24:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:09,613 INFO L225 Difference]: With dead ends: 25879 [2019-10-15 01:24:09,613 INFO L226 Difference]: Without dead ends: 16012 [2019-10-15 01:24:09,632 INFO L600 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-15 01:24:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16012 states. [2019-10-15 01:24:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16012 to 15991. [2019-10-15 01:24:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15991 states. [2019-10-15 01:24:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15991 states to 15991 states and 23833 transitions. [2019-10-15 01:24:10,621 INFO L78 Accepts]: Start accepts. Automaton has 15991 states and 23833 transitions. Word has length 157 [2019-10-15 01:24:10,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:10,622 INFO L462 AbstractCegarLoop]: Abstraction has 15991 states and 23833 transitions. [2019-10-15 01:24:10,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 15991 states and 23833 transitions. [2019-10-15 01:24:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:24:10,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:10,631 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:24:10,631 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash 39936174, now seen corresponding path program 1 times [2019-10-15 01:24:10,632 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:10,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722972014] [2019-10-15 01:24:10,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:10,853 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-15 01:24:10,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722972014] [2019-10-15 01:24:10,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:10,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:10,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496377400] [2019-10-15 01:24:10,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:10,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:10,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:10,856 INFO L87 Difference]: Start difference. First operand 15991 states and 23833 transitions. Second operand 4 states. [2019-10-15 01:24:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:12,956 INFO L93 Difference]: Finished difference Result 46929 states and 69966 transitions. [2019-10-15 01:24:12,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:12,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-15 01:24:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:12,993 INFO L225 Difference]: With dead ends: 46929 [2019-10-15 01:24:12,993 INFO L226 Difference]: Without dead ends: 30981 [2019-10-15 01:24:13,022 INFO L600 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-15 01:24:13,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30981 states. [2019-10-15 01:24:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30981 to 30940. [2019-10-15 01:24:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30940 states. [2019-10-15 01:24:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30940 states to 30940 states and 45871 transitions. [2019-10-15 01:24:14,610 INFO L78 Accepts]: Start accepts. Automaton has 30940 states and 45871 transitions. Word has length 161 [2019-10-15 01:24:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:14,610 INFO L462 AbstractCegarLoop]: Abstraction has 30940 states and 45871 transitions. [2019-10-15 01:24:14,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 30940 states and 45871 transitions. [2019-10-15 01:24:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:24:14,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:14,625 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:24:14,625 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:14,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:14,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1035308930, now seen corresponding path program 1 times [2019-10-15 01:24:14,626 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:14,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909923007] [2019-10-15 01:24:14,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:14,687 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-15 01:24:14,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909923007] [2019-10-15 01:24:14,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:14,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:14,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165699258] [2019-10-15 01:24:14,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:14,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:14,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:14,690 INFO L87 Difference]: Start difference. First operand 30940 states and 45871 transitions. Second operand 3 states. [2019-10-15 01:24:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:18,303 INFO L93 Difference]: Finished difference Result 92618 states and 137356 transitions. [2019-10-15 01:24:18,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:18,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-15 01:24:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:18,379 INFO L225 Difference]: With dead ends: 92618 [2019-10-15 01:24:18,379 INFO L226 Difference]: Without dead ends: 61788 [2019-10-15 01:24:18,406 INFO L600 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-15 01:24:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61788 states. [2019-10-15 01:24:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61788 to 30946. [2019-10-15 01:24:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30946 states. [2019-10-15 01:24:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30946 states to 30946 states and 45877 transitions. [2019-10-15 01:24:20,257 INFO L78 Accepts]: Start accepts. Automaton has 30946 states and 45877 transitions. Word has length 162 [2019-10-15 01:24:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:20,258 INFO L462 AbstractCegarLoop]: Abstraction has 30946 states and 45877 transitions. [2019-10-15 01:24:20,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 30946 states and 45877 transitions. [2019-10-15 01:24:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:24:20,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:20,267 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:24:20,267 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:20,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1360973299, now seen corresponding path program 1 times [2019-10-15 01:24:20,268 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:20,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673149277] [2019-10-15 01:24:20,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:20,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:20,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:20,464 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-15 01:24:20,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673149277] [2019-10-15 01:24:20,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:20,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:20,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326190048] [2019-10-15 01:24:20,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:20,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:20,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:20,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:20,474 INFO L87 Difference]: Start difference. First operand 30946 states and 45877 transitions. Second operand 4 states. [2019-10-15 01:24:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:22,352 INFO L93 Difference]: Finished difference Result 61850 states and 91698 transitions. [2019-10-15 01:24:22,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:22,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-15 01:24:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted.