/usr/bin/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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:04:50,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:04:50,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:04:50,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:04:50,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:04:50,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:04:50,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:04:50,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:04:51,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:04:51,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:04:51,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:04:51,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:04:51,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:04:51,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:04:51,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:04:51,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:04:51,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:04:51,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:04:51,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:04:51,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:04:51,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:04:51,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:04:51,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:04:51,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:04:51,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:04:51,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:04:51,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:04:51,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:04:51,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:04:51,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:04:51,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:04:51,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:04:51,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:04:51,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:04:51,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:04:51,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:04:51,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:04:51,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:04:51,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:04:51,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:04:51,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:04:51,052 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-11-07 01:04:51,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:04:51,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:04:51,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:04:51,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:04:51,068 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:04:51,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:04:51,068 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:04:51,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:04:51,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:04:51,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:04:51,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:04:51,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:04:51,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:04:51,069 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:04:51,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:04:51,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:04:51,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:04:51,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:04:51,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:04:51,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:04:51,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:04:51,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:04:51,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:04:51,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:04:51,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:04:51,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:04:51,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:04:51,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:04:51,072 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-11-07 01:04:51,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:04:51,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:04:51,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:04:51,407 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:04:51,407 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:04:51,408 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:04:51,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ca5a3e2/02987ba9c6834068b5d1bdf561d0aa1d/FLAG293ce3ed9 [2019-11-07 01:04:52,131 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:04:52,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:04:52,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ca5a3e2/02987ba9c6834068b5d1bdf561d0aa1d/FLAG293ce3ed9 [2019-11-07 01:04:52,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ca5a3e2/02987ba9c6834068b5d1bdf561d0aa1d [2019-11-07 01:04:52,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:04:52,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:04:52,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:52,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:04:52,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:04:52,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:52" (1/1) ... [2019-11-07 01:04:52,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2608f926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:52, skipping insertion in model container [2019-11-07 01:04:52,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:52" (1/1) ... [2019-11-07 01:04:52,415 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:04:52,498 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:04:53,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:53,206 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:04:53,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:04:53,616 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:04:53,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53 WrapperNode [2019-11-07 01:04:53,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:04:53,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:04:53,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:04:53,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:04:53,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (1/1) ... [2019-11-07 01:04:53,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:04:53,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:04:53,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:04:53,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:04:53,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (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-11-07 01:04:53,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:04:53,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:04:53,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:04:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:04:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:04:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:04:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:04:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:04:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:04:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:04:53,885 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:04:53,885 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:04:53,885 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:04:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:04:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:04:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:04:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:04:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:04:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:04:55,632 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:04:55,633 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:04:55,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:55 BoogieIcfgContainer [2019-11-07 01:04:55,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:04:55,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:04:55,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:04:55,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:04:55,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:04:52" (1/3) ... [2019-11-07 01:04:55,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dda7600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:55, skipping insertion in model container [2019-11-07 01:04:55,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53" (2/3) ... [2019-11-07 01:04:55,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dda7600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:04:55, skipping insertion in model container [2019-11-07 01:04:55,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:04:55" (3/3) ... [2019-11-07 01:04:55,644 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:04:55,655 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:04:55,665 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 01:04:55,677 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 01:04:55,708 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:04:55,708 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:04:55,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:04:55,708 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:04:55,708 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:04:55,709 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:04:55,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:04:55,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:04:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states. [2019-11-07 01:04:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-07 01:04:55,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:55,755 INFO L410 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-11-07 01:04:55,757 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:55,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:55,764 INFO L82 PathProgramCache]: Analyzing trace with hash -378109419, now seen corresponding path program 1 times [2019-11-07 01:04:55,772 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:55,772 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983844487] [2019-11-07 01:04:55,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:56,634 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983844487] [2019-11-07 01:04:56,635 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:56,635 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:56,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628732662] [2019-11-07 01:04:56,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:56,648 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:56,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:56,669 INFO L87 Difference]: Start difference. First operand 393 states. Second operand 4 states. [2019-11-07 01:04:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:56,956 INFO L93 Difference]: Finished difference Result 1140 states and 2047 transitions. [2019-11-07 01:04:56,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:04:56,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-07 01:04:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:56,979 INFO L225 Difference]: With dead ends: 1140 [2019-11-07 01:04:56,980 INFO L226 Difference]: Without dead ends: 752 [2019-11-07 01:04:56,986 INFO L630 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-11-07 01:04:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-11-07 01:04:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 726. [2019-11-07 01:04:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-11-07 01:04:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1035 transitions. [2019-11-07 01:04:57,137 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1035 transitions. Word has length 145 [2019-11-07 01:04:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:57,138 INFO L462 AbstractCegarLoop]: Abstraction has 726 states and 1035 transitions. [2019-11-07 01:04:57,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1035 transitions. [2019-11-07 01:04:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-07 01:04:57,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:57,151 INFO L410 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] [2019-11-07 01:04:57,152 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:57,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:57,152 INFO L82 PathProgramCache]: Analyzing trace with hash 785847517, now seen corresponding path program 1 times [2019-11-07 01:04:57,153 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:57,153 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288707015] [2019-11-07 01:04:57,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:57,299 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288707015] [2019-11-07 01:04:57,299 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:57,299 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:57,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038729127] [2019-11-07 01:04:57,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:57,302 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:57,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:57,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:57,303 INFO L87 Difference]: Start difference. First operand 726 states and 1035 transitions. Second operand 3 states. [2019-11-07 01:04:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:57,396 INFO L93 Difference]: Finished difference Result 2132 states and 3035 transitions. [2019-11-07 01:04:57,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:57,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-07 01:04:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:57,404 INFO L225 Difference]: With dead ends: 2132 [2019-11-07 01:04:57,404 INFO L226 Difference]: Without dead ends: 1438 [2019-11-07 01:04:57,407 INFO L630 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-11-07 01:04:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2019-11-07 01:04:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 728. [2019-11-07 01:04:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-11-07 01:04:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1037 transitions. [2019-11-07 01:04:57,463 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1037 transitions. Word has length 146 [2019-11-07 01:04:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:57,465 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 1037 transitions. [2019-11-07 01:04:57,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1037 transitions. [2019-11-07 01:04:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:04:57,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:57,470 INFO L410 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-11-07 01:04:57,470 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:57,471 INFO L82 PathProgramCache]: Analyzing trace with hash 615628916, now seen corresponding path program 1 times [2019-11-07 01:04:57,472 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:57,472 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380102457] [2019-11-07 01:04:57,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:57,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380102457] [2019-11-07 01:04:57,706 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:57,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:57,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697812230] [2019-11-07 01:04:57,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:57,708 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:57,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:57,709 INFO L87 Difference]: Start difference. First operand 728 states and 1037 transitions. Second operand 4 states. [2019-11-07 01:04:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:57,783 INFO L93 Difference]: Finished difference Result 1438 states and 2049 transitions. [2019-11-07 01:04:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:57,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-07 01:04:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:57,789 INFO L225 Difference]: With dead ends: 1438 [2019-11-07 01:04:57,790 INFO L226 Difference]: Without dead ends: 728 [2019-11-07 01:04:57,792 INFO L630 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-11-07 01:04:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-11-07 01:04:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 727. [2019-11-07 01:04:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-11-07 01:04:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1034 transitions. [2019-11-07 01:04:57,836 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1034 transitions. Word has length 147 [2019-11-07 01:04:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:57,836 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1034 transitions. [2019-11-07 01:04:57,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1034 transitions. [2019-11-07 01:04:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:04:57,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:57,840 INFO L410 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-11-07 01:04:57,840 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1544797217, now seen corresponding path program 1 times [2019-11-07 01:04:57,841 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:57,842 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173159903] [2019-11-07 01:04:57,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:58,041 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173159903] [2019-11-07 01:04:58,042 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:58,042 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:58,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825466135] [2019-11-07 01:04:58,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:58,044 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:58,045 INFO L87 Difference]: Start difference. First operand 727 states and 1034 transitions. Second operand 3 states. [2019-11-07 01:04:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:58,217 INFO L93 Difference]: Finished difference Result 1957 states and 2793 transitions. [2019-11-07 01:04:58,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:58,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-07 01:04:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:58,226 INFO L225 Difference]: With dead ends: 1957 [2019-11-07 01:04:58,226 INFO L226 Difference]: Without dead ends: 1409 [2019-11-07 01:04:58,228 INFO L630 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-11-07 01:04:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2019-11-07 01:04:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1383. [2019-11-07 01:04:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2019-11-07 01:04:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1959 transitions. [2019-11-07 01:04:58,300 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1959 transitions. Word has length 147 [2019-11-07 01:04:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:58,302 INFO L462 AbstractCegarLoop]: Abstraction has 1383 states and 1959 transitions. [2019-11-07 01:04:58,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1959 transitions. [2019-11-07 01:04:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:04:58,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:58,306 INFO L410 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-11-07 01:04:58,307 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:58,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1137007516, now seen corresponding path program 1 times [2019-11-07 01:04:58,307 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:58,308 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334283569] [2019-11-07 01:04:58,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:58,546 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334283569] [2019-11-07 01:04:58,547 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:58,547 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:04:58,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095604438] [2019-11-07 01:04:58,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:04:58,548 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:58,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:04:58,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:04:58,549 INFO L87 Difference]: Start difference. First operand 1383 states and 1959 transitions. Second operand 4 states. [2019-11-07 01:04:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:58,644 INFO L93 Difference]: Finished difference Result 2275 states and 3231 transitions. [2019-11-07 01:04:58,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:04:58,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-07 01:04:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:58,654 INFO L225 Difference]: With dead ends: 2275 [2019-11-07 01:04:58,655 INFO L226 Difference]: Without dead ends: 1061 [2019-11-07 01:04:58,657 INFO L630 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-11-07 01:04:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-11-07 01:04:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2019-11-07 01:04:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-11-07 01:04:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1494 transitions. [2019-11-07 01:04:58,729 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1494 transitions. Word has length 147 [2019-11-07 01:04:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:58,730 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 1494 transitions. [2019-11-07 01:04:58,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:04:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1494 transitions. [2019-11-07 01:04:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 01:04:58,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:58,734 INFO L410 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] [2019-11-07 01:04:58,734 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:58,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:58,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1811444338, now seen corresponding path program 1 times [2019-11-07 01:04:58,735 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:58,735 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801796437] [2019-11-07 01:04:58,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:58,892 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801796437] [2019-11-07 01:04:58,893 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:04:58,893 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:04:58,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545895685] [2019-11-07 01:04:58,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:04:58,895 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:58,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:04:58,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:04:58,895 INFO L87 Difference]: Start difference. First operand 1061 states and 1494 transitions. Second operand 3 states. [2019-11-07 01:04:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:59,333 INFO L93 Difference]: Finished difference Result 2751 states and 3920 transitions. [2019-11-07 01:04:59,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:04:59,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-07 01:04:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:59,345 INFO L225 Difference]: With dead ends: 2751 [2019-11-07 01:04:59,345 INFO L226 Difference]: Without dead ends: 1942 [2019-11-07 01:04:59,348 INFO L630 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-11-07 01:04:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-11-07 01:04:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1916. [2019-11-07 01:04:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2019-11-07 01:04:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2713 transitions. [2019-11-07 01:04:59,474 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2713 transitions. Word has length 153 [2019-11-07 01:04:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:59,475 INFO L462 AbstractCegarLoop]: Abstraction has 1916 states and 2713 transitions. [2019-11-07 01:04:59,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:04:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2713 transitions. [2019-11-07 01:04:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 01:04:59,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:59,485 INFO L410 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] [2019-11-07 01:04:59,485 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:59,486 INFO L82 PathProgramCache]: Analyzing trace with hash 404324973, now seen corresponding path program 1 times [2019-11-07 01:04:59,494 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:59,495 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629822384] [2019-11-07 01:04:59,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:00,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-11-07 01:05:00,031 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629822384] [2019-11-07 01:05:00,032 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:00,032 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 01:05:00,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238060867] [2019-11-07 01:05:00,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 01:05:00,032 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 01:05:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-07 01:05:00,033 INFO L87 Difference]: Start difference. First operand 1916 states and 2713 transitions. Second operand 13 states. [2019-11-07 01:05:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:02,616 INFO L93 Difference]: Finished difference Result 7242 states and 11196 transitions. [2019-11-07 01:05:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 01:05:02,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2019-11-07 01:05:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:02,645 INFO L225 Difference]: With dead ends: 7242 [2019-11-07 01:05:02,645 INFO L226 Difference]: Without dead ends: 5602 [2019-11-07 01:05:02,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2019-11-07 01:05:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2019-11-07 01:05:02,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 3296. [2019-11-07 01:05:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3296 states. [2019-11-07 01:05:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 4983 transitions. [2019-11-07 01:05:02,942 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 4983 transitions. Word has length 153 [2019-11-07 01:05:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:02,943 INFO L462 AbstractCegarLoop]: Abstraction has 3296 states and 4983 transitions. [2019-11-07 01:05:02,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 01:05:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 4983 transitions. [2019-11-07 01:05:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 01:05:02,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:02,947 INFO L410 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] [2019-11-07 01:05:02,948 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:02,948 INFO L82 PathProgramCache]: Analyzing trace with hash -685965993, now seen corresponding path program 1 times [2019-11-07 01:05:02,949 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:02,949 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909386113] [2019-11-07 01:05:02,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:03,182 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909386113] [2019-11-07 01:05:03,182 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:03,182 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:05:03,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910971928] [2019-11-07 01:05:03,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:05:03,183 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:05:03,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:03,184 INFO L87 Difference]: Start difference. First operand 3296 states and 4983 transitions. Second operand 8 states. [2019-11-07 01:05:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:03,774 INFO L93 Difference]: Finished difference Result 6873 states and 10638 transitions. [2019-11-07 01:05:03,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:03,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 153 [2019-11-07 01:05:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:03,796 INFO L225 Difference]: With dead ends: 6873 [2019-11-07 01:05:03,796 INFO L226 Difference]: Without dead ends: 4901 [2019-11-07 01:05:03,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-11-07 01:05:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 3984. [2019-11-07 01:05:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3984 states. [2019-11-07 01:05:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 5886 transitions. [2019-11-07 01:05:04,063 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 5886 transitions. Word has length 153 [2019-11-07 01:05:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:04,064 INFO L462 AbstractCegarLoop]: Abstraction has 3984 states and 5886 transitions. [2019-11-07 01:05:04,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:05:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 5886 transitions. [2019-11-07 01:05:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 01:05:04,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:04,072 INFO L410 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] [2019-11-07 01:05:04,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:04,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1419709992, now seen corresponding path program 1 times [2019-11-07 01:05:04,073 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:04,073 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670182547] [2019-11-07 01:05:04,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:04,291 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670182547] [2019-11-07 01:05:04,291 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:04,291 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:04,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669489164] [2019-11-07 01:05:04,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:04,292 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:04,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:04,293 INFO L87 Difference]: Start difference. First operand 3984 states and 5886 transitions. Second operand 4 states. [2019-11-07 01:05:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:04,762 INFO L93 Difference]: Finished difference Result 10383 states and 15339 transitions. [2019-11-07 01:05:04,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:04,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-07 01:05:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:04,805 INFO L225 Difference]: With dead ends: 10383 [2019-11-07 01:05:04,805 INFO L226 Difference]: Without dead ends: 6426 [2019-11-07 01:05:04,816 INFO L630 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-11-07 01:05:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6426 states. [2019-11-07 01:05:05,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6426 to 6404. [2019-11-07 01:05:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6404 states. [2019-11-07 01:05:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6404 states to 6404 states and 9378 transitions. [2019-11-07 01:05:05,197 INFO L78 Accepts]: Start accepts. Automaton has 6404 states and 9378 transitions. Word has length 153 [2019-11-07 01:05:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:05,199 INFO L462 AbstractCegarLoop]: Abstraction has 6404 states and 9378 transitions. [2019-11-07 01:05:05,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6404 states and 9378 transitions. [2019-11-07 01:05:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 01:05:05,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:05,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:05,208 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:05,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:05,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1518674242, now seen corresponding path program 1 times [2019-11-07 01:05:05,209 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:05,209 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457355064] [2019-11-07 01:05:05,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:05,324 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457355064] [2019-11-07 01:05:05,324 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:05,325 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:05,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669858646] [2019-11-07 01:05:05,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:05,328 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:05,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:05,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:05,329 INFO L87 Difference]: Start difference. First operand 6404 states and 9378 transitions. Second operand 3 states. [2019-11-07 01:05:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:05,994 INFO L93 Difference]: Finished difference Result 16047 states and 23518 transitions. [2019-11-07 01:05:05,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:05,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-07 01:05:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:06,030 INFO L225 Difference]: With dead ends: 16047 [2019-11-07 01:05:06,031 INFO L226 Difference]: Without dead ends: 9996 [2019-11-07 01:05:06,053 INFO L630 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-11-07 01:05:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2019-11-07 01:05:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 9976. [2019-11-07 01:05:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9976 states. [2019-11-07 01:05:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9976 states to 9976 states and 14410 transitions. [2019-11-07 01:05:06,726 INFO L78 Accepts]: Start accepts. Automaton has 9976 states and 14410 transitions. Word has length 155 [2019-11-07 01:05:06,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:06,726 INFO L462 AbstractCegarLoop]: Abstraction has 9976 states and 14410 transitions. [2019-11-07 01:05:06,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 9976 states and 14410 transitions. [2019-11-07 01:05:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:05:06,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:06,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:06,739 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:06,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1456809787, now seen corresponding path program 1 times [2019-11-07 01:05:06,739 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:06,740 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556422464] [2019-11-07 01:05:06,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:06,898 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556422464] [2019-11-07 01:05:06,898 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:06,898 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:06,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322172133] [2019-11-07 01:05:06,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:06,899 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:06,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:06,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:06,900 INFO L87 Difference]: Start difference. First operand 9976 states and 14410 transitions. Second operand 4 states. [2019-11-07 01:05:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:08,131 INFO L93 Difference]: Finished difference Result 20942 states and 30881 transitions. [2019-11-07 01:05:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:08,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-07 01:05:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:08,177 INFO L225 Difference]: With dead ends: 20942 [2019-11-07 01:05:08,177 INFO L226 Difference]: Without dead ends: 16040 [2019-11-07 01:05:08,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16040 states. [2019-11-07 01:05:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16040 to 16038. [2019-11-07 01:05:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16038 states. [2019-11-07 01:05:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16038 states to 16038 states and 22893 transitions. [2019-11-07 01:05:09,128 INFO L78 Accepts]: Start accepts. Automaton has 16038 states and 22893 transitions. Word has length 161 [2019-11-07 01:05:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:09,128 INFO L462 AbstractCegarLoop]: Abstraction has 16038 states and 22893 transitions. [2019-11-07 01:05:09,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 16038 states and 22893 transitions. [2019-11-07 01:05:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 01:05:09,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:09,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:09,151 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:09,151 INFO L82 PathProgramCache]: Analyzing trace with hash -833013491, now seen corresponding path program 1 times [2019-11-07 01:05:09,152 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:09,152 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295604262] [2019-11-07 01:05:09,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:09,320 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295604262] [2019-11-07 01:05:09,320 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:09,320 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:09,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104664469] [2019-11-07 01:05:09,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:09,321 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:09,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:09,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:09,322 INFO L87 Difference]: Start difference. First operand 16038 states and 22893 transitions. Second operand 4 states. [2019-11-07 01:05:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:10,649 INFO L93 Difference]: Finished difference Result 46992 states and 66908 transitions. [2019-11-07 01:05:10,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:10,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-07 01:05:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:10,726 INFO L225 Difference]: With dead ends: 46992 [2019-11-07 01:05:10,726 INFO L226 Difference]: Without dead ends: 30997 [2019-11-07 01:05:10,756 INFO L630 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-11-07 01:05:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30997 states. [2019-11-07 01:05:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30997 to 30947. [2019-11-07 01:05:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30947 states. [2019-11-07 01:05:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30947 states to 30947 states and 43619 transitions. [2019-11-07 01:05:13,138 INFO L78 Accepts]: Start accepts. Automaton has 30947 states and 43619 transitions. Word has length 161 [2019-11-07 01:05:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:13,139 INFO L462 AbstractCegarLoop]: Abstraction has 30947 states and 43619 transitions. [2019-11-07 01:05:13,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 30947 states and 43619 transitions. [2019-11-07 01:05:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-07 01:05:13,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:13,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:13,171 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:13,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1467447725, now seen corresponding path program 1 times [2019-11-07 01:05:13,172 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:13,172 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026527454] [2019-11-07 01:05:13,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:13,235 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026527454] [2019-11-07 01:05:13,235 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:13,235 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:13,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349453902] [2019-11-07 01:05:13,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:13,236 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:13,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:13,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:13,237 INFO L87 Difference]: Start difference. First operand 30947 states and 43619 transitions. Second operand 3 states. [2019-11-07 01:05:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:16,732 INFO L93 Difference]: Finished difference Result 92649 states and 130610 transitions. [2019-11-07 01:05:16,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:16,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-07 01:05:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:17,032 INFO L225 Difference]: With dead ends: 92649 [2019-11-07 01:05:17,032 INFO L226 Difference]: Without dead ends: 61807 [2019-11-07 01:05:17,083 INFO L630 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-11-07 01:05:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61807 states. [2019-11-07 01:05:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61807 to 30953. [2019-11-07 01:05:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30953 states. [2019-11-07 01:05:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30953 states to 30953 states and 43625 transitions. [2019-11-07 01:05:19,537 INFO L78 Accepts]: Start accepts. Automaton has 30953 states and 43625 transitions. Word has length 162 [2019-11-07 01:05:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:19,537 INFO L462 AbstractCegarLoop]: Abstraction has 30953 states and 43625 transitions. [2019-11-07 01:05:19,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 30953 states and 43625 transitions. [2019-11-07 01:05:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-07 01:05:19,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:19,562 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:19,562 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:19,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1559304139, now seen corresponding path program 1 times [2019-11-07 01:05:19,563 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:19,563 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727508213] [2019-11-07 01:05:19,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:19,671 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727508213] [2019-11-07 01:05:19,671 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:19,671 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:19,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353672665] [2019-11-07 01:05:19,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:19,672 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:19,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:19,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:19,672 INFO L87 Difference]: Start difference. First operand 30953 states and 43625 transitions. Second operand 3 states. [2019-11-07 01:05:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:22,012 INFO L93 Difference]: Finished difference Result 80878 states and 113504 transitions. [2019-11-07 01:05:22,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:22,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-07 01:05:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:22,117 INFO L225 Difference]: With dead ends: 80878 [2019-11-07 01:05:22,118 INFO L226 Difference]: Without dead ends: 50606 [2019-11-07 01:05:22,149 INFO L630 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-11-07 01:05:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50606 states. [2019-11-07 01:05:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50606 to 50556. [2019-11-07 01:05:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50556 states.