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_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:48,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:48,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:48,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:48,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:48,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:48,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:48,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:48,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:48,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:48,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:48,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:48,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:48,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:48,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:48,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:48,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:48,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:48,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:48,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:48,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:48,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:48,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:48,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:48,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:48,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:48,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:48,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:48,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:48,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:48,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:48,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:48,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:48,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:48,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:48,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:48,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:48,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:48,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:48,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:48,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:48,848 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:22:48,862 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:48,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:48,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:48,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:48,864 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:48,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:48,864 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:48,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:48,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:48,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:48,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:48,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:48,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:48,866 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:48,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:48,866 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:48,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:48,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:48,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:48,867 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:48,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:48,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:48,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:48,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:48,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:48,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:48,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:48,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:48,869 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:22:49,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:49,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:49,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:49,156 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:49,156 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:49,157 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:22:49,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f90d4d62/896e9e88afd84315aafdfc281705e452/FLAG5afe6ceae [2019-10-15 01:22:49,800 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:49,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:22:49,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f90d4d62/896e9e88afd84315aafdfc281705e452/FLAG5afe6ceae [2019-10-15 01:22:50,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f90d4d62/896e9e88afd84315aafdfc281705e452 [2019-10-15 01:22:50,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:50,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:50,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:50,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:50,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:50,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:50" (1/1) ... [2019-10-15 01:22:50,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd793fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:50, skipping insertion in model container [2019-10-15 01:22:50,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:50" (1/1) ... [2019-10-15 01:22:50,129 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:50,198 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:50,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:50,812 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:51,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:51,283 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:51,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51 WrapperNode [2019-10-15 01:22:51,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:51,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:51,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:51,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:51,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (1/1) ... [2019-10-15 01:22:51,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:51,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:51,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:51,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:51,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (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:22:51,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:51,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:51,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:51,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:51,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:51,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:51,511 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:51,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:51,512 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:51,512 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:51,514 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:51,514 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:51,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:53,175 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:53,175 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:53,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:53 BoogieIcfgContainer [2019-10-15 01:22:53,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:53,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:53,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:53,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:53,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:50" (1/3) ... [2019-10-15 01:22:53,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71264f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:53, skipping insertion in model container [2019-10-15 01:22:53,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:51" (2/3) ... [2019-10-15 01:22:53,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71264f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:53, skipping insertion in model container [2019-10-15 01:22:53,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:53" (3/3) ... [2019-10-15 01:22:53,185 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:22:53,195 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:53,218 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-15 01:22:53,230 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-15 01:22:53,258 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:53,258 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:53,258 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:53,258 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:53,258 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:53,259 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:53,259 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:53,259 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states. [2019-10-15 01:22:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:22:53,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:53,317 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] [2019-10-15 01:22:53,319 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:53,325 INFO L82 PathProgramCache]: Analyzing trace with hash -737000611, now seen corresponding path program 1 times [2019-10-15 01:22:53,335 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:53,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783398335] [2019-10-15 01:22:53,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:54,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783398335] [2019-10-15 01:22:54,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:54,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:54,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831018284] [2019-10-15 01:22:54,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:54,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:54,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:54,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:54,057 INFO L87 Difference]: Start difference. First operand 371 states. Second operand 3 states. [2019-10-15 01:22:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:54,307 INFO L93 Difference]: Finished difference Result 667 states and 1188 transitions. [2019-10-15 01:22:54,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:54,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-15 01:22:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:54,346 INFO L225 Difference]: With dead ends: 667 [2019-10-15 01:22:54,346 INFO L226 Difference]: Without dead ends: 520 [2019-10-15 01:22:54,353 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:22:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-10-15 01:22:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2019-10-15 01:22:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-10-15 01:22:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 755 transitions. [2019-10-15 01:22:54,463 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 755 transitions. Word has length 140 [2019-10-15 01:22:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:54,464 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 755 transitions. [2019-10-15 01:22:54,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 755 transitions. [2019-10-15 01:22:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:22:54,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:54,474 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] [2019-10-15 01:22:54,475 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:54,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1264797844, now seen corresponding path program 1 times [2019-10-15 01:22:54,476 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:54,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335459793] [2019-10-15 01:22:54,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:54,727 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:22:54,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335459793] [2019-10-15 01:22:54,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:54,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:54,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442438239] [2019-10-15 01:22:54,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:54,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:54,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:54,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:54,731 INFO L87 Difference]: Start difference. First operand 518 states and 755 transitions. Second operand 3 states. [2019-10-15 01:22:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:54,929 INFO L93 Difference]: Finished difference Result 1029 states and 1554 transitions. [2019-10-15 01:22:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:54,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-15 01:22:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:54,938 INFO L225 Difference]: With dead ends: 1029 [2019-10-15 01:22:54,939 INFO L226 Difference]: Without dead ends: 824 [2019-10-15 01:22:54,943 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:22:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-10-15 01:22:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 822. [2019-10-15 01:22:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-10-15 01:22:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1219 transitions. [2019-10-15 01:22:54,993 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1219 transitions. Word has length 140 [2019-10-15 01:22:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:54,993 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1219 transitions. [2019-10-15 01:22:54,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1219 transitions. [2019-10-15 01:22:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:22:54,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:54,997 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] [2019-10-15 01:22:54,997 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:54,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1075415587, now seen corresponding path program 1 times [2019-10-15 01:22:54,998 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:54,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618831479] [2019-10-15 01:22:54,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:55,123 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:22:55,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618831479] [2019-10-15 01:22:55,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:55,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:55,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744806736] [2019-10-15 01:22:55,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:55,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:55,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:55,126 INFO L87 Difference]: Start difference. First operand 822 states and 1219 transitions. Second operand 3 states. [2019-10-15 01:22:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:55,325 INFO L93 Difference]: Finished difference Result 1781 states and 2727 transitions. [2019-10-15 01:22:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:55,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-15 01:22:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:55,338 INFO L225 Difference]: With dead ends: 1781 [2019-10-15 01:22:55,339 INFO L226 Difference]: Without dead ends: 1436 [2019-10-15 01:22:55,342 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:22:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-10-15 01:22:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1434. [2019-10-15 01:22:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-10-15 01:22:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2151 transitions. [2019-10-15 01:22:55,423 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2151 transitions. Word has length 140 [2019-10-15 01:22:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:55,425 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 2151 transitions. [2019-10-15 01:22:55,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2151 transitions. [2019-10-15 01:22:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:22:55,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:55,431 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] [2019-10-15 01:22:55,432 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1075754211, now seen corresponding path program 1 times [2019-10-15 01:22:55,433 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:55,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525362432] [2019-10-15 01:22:55,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:55,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:55,967 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:22:55,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525362432] [2019-10-15 01:22:55,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:55,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:55,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991863902] [2019-10-15 01:22:55,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:55,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:55,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:55,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:55,970 INFO L87 Difference]: Start difference. First operand 1434 states and 2151 transitions. Second operand 4 states. [2019-10-15 01:22:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:56,175 INFO L93 Difference]: Finished difference Result 4221 states and 6322 transitions. [2019-10-15 01:22:56,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:56,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-15 01:22:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:56,190 INFO L225 Difference]: With dead ends: 4221 [2019-10-15 01:22:56,190 INFO L226 Difference]: Without dead ends: 2800 [2019-10-15 01:22:56,194 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:22:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-10-15 01:22:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2760. [2019-10-15 01:22:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-10-15 01:22:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4117 transitions. [2019-10-15 01:22:56,322 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 4117 transitions. Word has length 140 [2019-10-15 01:22:56,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:56,323 INFO L462 AbstractCegarLoop]: Abstraction has 2760 states and 4117 transitions. [2019-10-15 01:22:56,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 4117 transitions. [2019-10-15 01:22:56,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:22:56,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:56,328 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] [2019-10-15 01:22:56,328 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:56,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:56,329 INFO L82 PathProgramCache]: Analyzing trace with hash -127121487, now seen corresponding path program 1 times [2019-10-15 01:22:56,329 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:56,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416956460] [2019-10-15 01:22:56,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:56,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:56,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:56,436 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:22:56,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416956460] [2019-10-15 01:22:56,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:56,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:56,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783868429] [2019-10-15 01:22:56,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:56,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:56,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:56,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:56,438 INFO L87 Difference]: Start difference. First operand 2760 states and 4117 transitions. Second operand 3 states. [2019-10-15 01:22:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:56,691 INFO L93 Difference]: Finished difference Result 8234 states and 12281 transitions. [2019-10-15 01:22:56,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:56,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-15 01:22:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:56,718 INFO L225 Difference]: With dead ends: 8234 [2019-10-15 01:22:56,719 INFO L226 Difference]: Without dead ends: 5506 [2019-10-15 01:22:56,725 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:22:56,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2019-10-15 01:22:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 2762. [2019-10-15 01:22:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2019-10-15 01:22:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4119 transitions. [2019-10-15 01:22:56,904 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4119 transitions. Word has length 141 [2019-10-15 01:22:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:56,905 INFO L462 AbstractCegarLoop]: Abstraction has 2762 states and 4119 transitions. [2019-10-15 01:22:56,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4119 transitions. [2019-10-15 01:22:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:22:56,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:56,910 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] [2019-10-15 01:22:56,910 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1322555170, now seen corresponding path program 1 times [2019-10-15 01:22:56,911 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:56,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820722742] [2019-10-15 01:22:56,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:56,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:56,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:57,152 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:22:57,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820722742] [2019-10-15 01:22:57,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:57,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:57,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416184953] [2019-10-15 01:22:57,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:57,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:57,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:57,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:57,156 INFO L87 Difference]: Start difference. First operand 2762 states and 4119 transitions. Second operand 4 states. [2019-10-15 01:22:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:57,323 INFO L93 Difference]: Finished difference Result 5510 states and 8220 transitions. [2019-10-15 01:22:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:57,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-15 01:22:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:57,346 INFO L225 Difference]: With dead ends: 5510 [2019-10-15 01:22:57,347 INFO L226 Difference]: Without dead ends: 2760 [2019-10-15 01:22:57,354 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:22:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2019-10-15 01:22:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2760. [2019-10-15 01:22:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-10-15 01:22:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4115 transitions. [2019-10-15 01:22:57,559 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 4115 transitions. Word has length 142 [2019-10-15 01:22:57,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:57,560 INFO L462 AbstractCegarLoop]: Abstraction has 2760 states and 4115 transitions. [2019-10-15 01:22:57,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 4115 transitions. [2019-10-15 01:22:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:22:57,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:57,569 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] [2019-10-15 01:22:57,569 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:57,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:57,570 INFO L82 PathProgramCache]: Analyzing trace with hash -82288669, now seen corresponding path program 1 times [2019-10-15 01:22:57,570 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:57,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751904414] [2019-10-15 01:22:57,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:57,711 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:22:57,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751904414] [2019-10-15 01:22:57,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:57,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:57,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884540262] [2019-10-15 01:22:57,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:57,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:57,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:57,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:57,713 INFO L87 Difference]: Start difference. First operand 2760 states and 4115 transitions. Second operand 3 states. [2019-10-15 01:22:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:58,011 INFO L93 Difference]: Finished difference Result 6674 states and 9953 transitions. [2019-10-15 01:22:58,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:58,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-15 01:22:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:58,030 INFO L225 Difference]: With dead ends: 6674 [2019-10-15 01:22:58,030 INFO L226 Difference]: Without dead ends: 4094 [2019-10-15 01:22:58,036 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:22:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4094 states. [2019-10-15 01:22:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4094 to 4054. [2019-10-15 01:22:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4054 states. [2019-10-15 01:22:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 5963 transitions. [2019-10-15 01:22:58,282 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 5963 transitions. Word has length 142 [2019-10-15 01:22:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,282 INFO L462 AbstractCegarLoop]: Abstraction has 4054 states and 5963 transitions. [2019-10-15 01:22:58,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 5963 transitions. [2019-10-15 01:22:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:22:58,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,291 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] [2019-10-15 01:22:58,291 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1177772960, now seen corresponding path program 1 times [2019-10-15 01:22:58,292 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159458128] [2019-10-15 01:22:58,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,533 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:22:58,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159458128] [2019-10-15 01:22:58,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:22:58,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015596959] [2019-10-15 01:22:58,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:22:58,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:22:58,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:22:58,535 INFO L87 Difference]: Start difference. First operand 4054 states and 5963 transitions. Second operand 8 states. [2019-10-15 01:23:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:00,060 INFO L93 Difference]: Finished difference Result 13639 states and 20990 transitions. [2019-10-15 01:23:00,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:23:00,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2019-10-15 01:23:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:00,104 INFO L225 Difference]: With dead ends: 13639 [2019-10-15 01:23:00,104 INFO L226 Difference]: Without dead ends: 9790 [2019-10-15 01:23:00,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:23:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9790 states. [2019-10-15 01:23:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9790 to 5376. [2019-10-15 01:23:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2019-10-15 01:23:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 7951 transitions. [2019-10-15 01:23:00,450 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 7951 transitions. Word has length 145 [2019-10-15 01:23:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:00,451 INFO L462 AbstractCegarLoop]: Abstraction has 5376 states and 7951 transitions. [2019-10-15 01:23:00,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:23:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 7951 transitions. [2019-10-15 01:23:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:23:00,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:00,457 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] [2019-10-15 01:23:00,458 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:00,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash -142350002, now seen corresponding path program 1 times [2019-10-15 01:23:00,458 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:00,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263805745] [2019-10-15 01:23:00,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:00,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:00,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:00,698 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:00,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263805745] [2019-10-15 01:23:00,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:00,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:00,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840001204] [2019-10-15 01:23:00,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:00,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:00,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:00,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:00,701 INFO L87 Difference]: Start difference. First operand 5376 states and 7951 transitions. Second operand 4 states. [2019-10-15 01:23:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:01,252 INFO L93 Difference]: Finished difference Result 14463 states and 21402 transitions. [2019-10-15 01:23:01,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:01,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-15 01:23:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:01,286 INFO L225 Difference]: With dead ends: 14463 [2019-10-15 01:23:01,286 INFO L226 Difference]: Without dead ends: 9110 [2019-10-15 01:23:01,299 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:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9110 states. [2019-10-15 01:23:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9110 to 9080. [2019-10-15 01:23:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9080 states. [2019-10-15 01:23:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 13336 transitions. [2019-10-15 01:23:01,893 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 13336 transitions. Word has length 145 [2019-10-15 01:23:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:01,894 INFO L462 AbstractCegarLoop]: Abstraction has 9080 states and 13336 transitions. [2019-10-15 01:23:01,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 13336 transitions. [2019-10-15 01:23:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:23:01,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:01,905 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] [2019-10-15 01:23:01,906 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:01,907 INFO L82 PathProgramCache]: Analyzing trace with hash -140462378, now seen corresponding path program 1 times [2019-10-15 01:23:01,907 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:01,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828170466] [2019-10-15 01:23:01,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:02,007 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:02,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828170466] [2019-10-15 01:23:02,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:02,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:02,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391598147] [2019-10-15 01:23:02,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:02,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:02,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:02,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:02,010 INFO L87 Difference]: Start difference. First operand 9080 states and 13336 transitions. Second operand 3 states. [2019-10-15 01:23:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:02,914 INFO L93 Difference]: Finished difference Result 24470 states and 36012 transitions. [2019-10-15 01:23:02,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:02,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-15 01:23:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:02,949 INFO L225 Difference]: With dead ends: 24470 [2019-10-15 01:23:02,949 INFO L226 Difference]: Without dead ends: 15751 [2019-10-15 01:23:02,971 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:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15751 states. [2019-10-15 01:23:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15751 to 15725. [2019-10-15 01:23:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15725 states. [2019-10-15 01:23:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15725 states to 15725 states and 22868 transitions. [2019-10-15 01:23:03,736 INFO L78 Accepts]: Start accepts. Automaton has 15725 states and 22868 transitions. Word has length 147 [2019-10-15 01:23:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:03,737 INFO L462 AbstractCegarLoop]: Abstraction has 15725 states and 22868 transitions. [2019-10-15 01:23:03,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 15725 states and 22868 transitions. [2019-10-15 01:23:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:23:03,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:03,752 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] [2019-10-15 01:23:03,752 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -35990567, now seen corresponding path program 1 times [2019-10-15 01:23:03,753 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:03,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279001889] [2019-10-15 01:23:03,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:03,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:03,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:03,912 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:03,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279001889] [2019-10-15 01:23:03,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:03,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:03,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080246828] [2019-10-15 01:23:03,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:03,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:03,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:03,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:03,914 INFO L87 Difference]: Start difference. First operand 15725 states and 22868 transitions. Second operand 4 states. [2019-10-15 01:23:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:04,795 INFO L93 Difference]: Finished difference Result 26933 states and 39252 transitions. [2019-10-15 01:23:04,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:04,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-15 01:23:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:04,825 INFO L225 Difference]: With dead ends: 26933 [2019-10-15 01:23:04,825 INFO L226 Difference]: Without dead ends: 13923 [2019-10-15 01:23:04,851 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:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13923 states. [2019-10-15 01:23:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13923 to 13923. [2019-10-15 01:23:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13923 states. [2019-10-15 01:23:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13923 states to 13923 states and 20193 transitions. [2019-10-15 01:23:06,158 INFO L78 Accepts]: Start accepts. Automaton has 13923 states and 20193 transitions. Word has length 147 [2019-10-15 01:23:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:06,159 INFO L462 AbstractCegarLoop]: Abstraction has 13923 states and 20193 transitions. [2019-10-15 01:23:06,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 13923 states and 20193 transitions. [2019-10-15 01:23:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:23:06,169 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:06,169 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:06,169 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash 274548163, now seen corresponding path program 1 times [2019-10-15 01:23:06,170 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:06,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865010337] [2019-10-15 01:23:06,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:06,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:06,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:06,374 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:06,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865010337] [2019-10-15 01:23:06,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:06,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:06,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915700016] [2019-10-15 01:23:06,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:06,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:06,376 INFO L87 Difference]: Start difference. First operand 13923 states and 20193 transitions. Second operand 4 states. [2019-10-15 01:23:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:07,638 INFO L93 Difference]: Finished difference Result 40726 states and 59115 transitions. [2019-10-15 01:23:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:07,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-15 01:23:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:07,679 INFO L225 Difference]: With dead ends: 40726 [2019-10-15 01:23:07,679 INFO L226 Difference]: Without dead ends: 26846 [2019-10-15 01:23:07,711 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:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26846 states. [2019-10-15 01:23:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26846 to 26786. [2019-10-15 01:23:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26786 states. [2019-10-15 01:23:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26786 states to 26786 states and 38548 transitions. [2019-10-15 01:23:09,118 INFO L78 Accepts]: Start accepts. Automaton has 26786 states and 38548 transitions. Word has length 150 [2019-10-15 01:23:09,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:09,118 INFO L462 AbstractCegarLoop]: Abstraction has 26786 states and 38548 transitions. [2019-10-15 01:23:09,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 26786 states and 38548 transitions. [2019-10-15 01:23:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:23:09,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:09,134 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:09,134 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:09,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:09,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1258286695, now seen corresponding path program 1 times [2019-10-15 01:23:09,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:09,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122643189] [2019-10-15 01:23:09,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:09,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:09,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:09,191 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:09,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122643189] [2019-10-15 01:23:09,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:09,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:09,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020581721] [2019-10-15 01:23:09,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:09,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:09,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:09,194 INFO L87 Difference]: Start difference. First operand 26786 states and 38548 transitions. Second operand 3 states. [2019-10-15 01:23:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:11,707 INFO L93 Difference]: Finished difference Result 80164 states and 115393 transitions. [2019-10-15 01:23:11,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:11,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-15 01:23:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:11,789 INFO L225 Difference]: With dead ends: 80164 [2019-10-15 01:23:11,789 INFO L226 Difference]: Without dead ends: 53484 [2019-10-15 01:23:11,844 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:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53484 states. [2019-10-15 01:23:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53484 to 26792. [2019-10-15 01:23:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26792 states. [2019-10-15 01:23:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26792 states to 26792 states and 38554 transitions. [2019-10-15 01:23:13,269 INFO L78 Accepts]: Start accepts. Automaton has 26792 states and 38554 transitions. Word has length 151 [2019-10-15 01:23:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:13,269 INFO L462 AbstractCegarLoop]: Abstraction has 26792 states and 38554 transitions. [2019-10-15 01:23:13,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 26792 states and 38554 transitions. [2019-10-15 01:23:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:23:13,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:13,284 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:13,285 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1962958739, now seen corresponding path program 1 times [2019-10-15 01:23:13,285 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:13,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34715050] [2019-10-15 01:23:13,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:13,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:13,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:13,542 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:13,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34715050] [2019-10-15 01:23:13,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:13,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:13,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092080706] [2019-10-15 01:23:13,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:13,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:13,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:13,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:13,545 INFO L87 Difference]: Start difference. First operand 26792 states and 38554 transitions. Second operand 3 states. [2019-10-15 01:23:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:15,567 INFO L93 Difference]: Finished difference Result 71898 states and 103214 transitions. [2019-10-15 01:23:15,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:15,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-15 01:23:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:15,609 INFO L225 Difference]: With dead ends: 71898 [2019-10-15 01:23:15,609 INFO L226 Difference]: Without dead ends: 45796 [2019-10-15 01:23:15,631 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:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45796 states. [2019-10-15 01:23:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45796 to 45736. [2019-10-15 01:23:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45736 states. [2019-10-15 01:23:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45736 states to 45736 states and 64696 transitions. [2019-10-15 01:23:18,620 INFO L78 Accepts]: Start accepts. Automaton has 45736 states and 64696 transitions. Word has length 152 [2019-10-15 01:23:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:18,620 INFO L462 AbstractCegarLoop]: Abstraction has 45736 states and 64696 transitions. [2019-10-15 01:23:18,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 45736 states and 64696 transitions. [2019-10-15 01:23:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:23:18,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:18,640 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:18,641 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash 800440458, now seen corresponding path program 1 times [2019-10-15 01:23:18,641 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:18,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154080788] [2019-10-15 01:23:18,642 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,642 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:18,791 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:18,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154080788] [2019-10-15 01:23:18,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:18,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:18,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835652412] [2019-10-15 01:23:18,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:18,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:18,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:18,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:18,794 INFO L87 Difference]: Start difference. First operand 45736 states and 64696 transitions. Second operand 4 states. [2019-10-15 01:23:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:20,754 INFO L93 Difference]: Finished difference Result 84797 states and 119985 transitions. [2019-10-15 01:23:20,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:20,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-15 01:23:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:20,793 INFO L225 Difference]: With dead ends: 84797 [2019-10-15 01:23:20,794 INFO L226 Difference]: Without dead ends: 39689 [2019-10-15 01:23:20,828 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:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39689 states. [2019-10-15 01:23:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39689 to 39689. [2019-10-15 01:23:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39689 states. [2019-10-15 01:23:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39689 states to 39689 states and 56023 transitions. [2019-10-15 01:23:22,809 INFO L78 Accepts]: Start accepts. Automaton has 39689 states and 56023 transitions. Word has length 152 [2019-10-15 01:23:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:22,810 INFO L462 AbstractCegarLoop]: Abstraction has 39689 states and 56023 transitions. [2019-10-15 01:23:22,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 39689 states and 56023 transitions. [2019-10-15 01:23:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:23:22,822 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:22,822 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] [2019-10-15 01:23:22,823 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:22,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:22,823 INFO L82 PathProgramCache]: Analyzing trace with hash -828085414, now seen corresponding path program 1 times [2019-10-15 01:23:22,823 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:22,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27172268] [2019-10-15 01:23:22,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:23,023 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:23,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27172268] [2019-10-15 01:23:23,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:23,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:23:23,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085138558] [2019-10-15 01:23:23,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:23:23,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:23,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:23:23,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:23,031 INFO L87 Difference]: Start difference. First operand 39689 states and 56023 transitions. Second operand 8 states.