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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:47,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:47,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:47,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:47,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:47,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:47,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:47,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:47,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:47,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:47,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:47,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:47,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:47,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:47,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:47,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:47,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:47,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:47,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:47,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:47,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:47,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:47,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:47,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:47,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:47,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:47,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:47,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:47,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:47,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:47,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:47,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:47,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:47,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:47,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:47,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:47,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:47,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:47,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:47,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:47,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:47,662 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-13 21:23:47,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:47,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:47,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:47,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:47,691 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:47,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:47,691 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:47,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:47,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:47,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:47,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:47,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:47,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:47,693 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:47,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:47,693 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:47,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:47,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:47,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:47,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:47,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:47,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:47,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:47,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:47,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:47,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:47,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:47,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:47,696 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-13 21:23:47,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:48,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:48,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:48,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:48,014 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:48,015 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+nlh-reducer.c [2019-10-13 21:23:48,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1ebfa21/ef61a8a0c43e4a218045f452dca24ac5/FLAGa5ae47234 [2019-10-13 21:23:48,646 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:48,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:48,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1ebfa21/ef61a8a0c43e4a218045f452dca24ac5/FLAGa5ae47234 [2019-10-13 21:23:48,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1ebfa21/ef61a8a0c43e4a218045f452dca24ac5 [2019-10-13 21:23:48,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:48,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:48,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:48,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:48,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:48,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:48" (1/1) ... [2019-10-13 21:23:48,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1118f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:48, skipping insertion in model container [2019-10-13 21:23:48,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:48" (1/1) ... [2019-10-13 21:23:48,938 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:49,024 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:49,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:49,578 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:49,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:49,770 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:49,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49 WrapperNode [2019-10-13 21:23:49,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:49,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:49,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:49,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:49,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (1/1) ... [2019-10-13 21:23:49,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:49,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:49,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:49,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:49,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (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-13 21:23:49,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:49,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:49,950 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:51,508 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:51,508 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:51,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:51 BoogieIcfgContainer [2019-10-13 21:23:51,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:51,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:51,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:51,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:51,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:48" (1/3) ... [2019-10-13 21:23:51,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393384c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:51, skipping insertion in model container [2019-10-13 21:23:51,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:49" (2/3) ... [2019-10-13 21:23:51,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393384c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:51, skipping insertion in model container [2019-10-13 21:23:51,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:51" (3/3) ... [2019-10-13 21:23:51,524 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:51,538 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:51,563 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:23:51,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:23:51,623 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:51,623 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:51,623 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:51,623 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:51,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:51,624 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:51,624 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:51,624 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states. [2019-10-13 21:23:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:23:51,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:51,698 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-13 21:23:51,700 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:51,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:51,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1545579630, now seen corresponding path program 1 times [2019-10-13 21:23:51,717 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:51,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023076245] [2019-10-13 21:23:51,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:51,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:51,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:52,444 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-13 21:23:52,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023076245] [2019-10-13 21:23:52,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:52,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:52,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61939074] [2019-10-13 21:23:52,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:52,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:52,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:52,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:52,474 INFO L87 Difference]: Start difference. First operand 299 states. Second operand 3 states. [2019-10-13 21:23:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:52,740 INFO L93 Difference]: Finished difference Result 569 states and 997 transitions. [2019-10-13 21:23:52,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:52,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-10-13 21:23:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:52,798 INFO L225 Difference]: With dead ends: 569 [2019-10-13 21:23:52,799 INFO L226 Difference]: Without dead ends: 465 [2019-10-13 21:23:52,803 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-13 21:23:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-13 21:23:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 463. [2019-10-13 21:23:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-13 21:23:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 686 transitions. [2019-10-13 21:23:52,895 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 686 transitions. Word has length 145 [2019-10-13 21:23:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:52,896 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 686 transitions. [2019-10-13 21:23:52,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:52,896 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 686 transitions. [2019-10-13 21:23:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:23:52,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:52,901 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-13 21:23:52,901 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:52,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1852792009, now seen corresponding path program 1 times [2019-10-13 21:23:52,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:52,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164140192] [2019-10-13 21:23:52,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:52,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:52,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:53,378 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-13 21:23:53,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164140192] [2019-10-13 21:23:53,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:53,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:53,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124835820] [2019-10-13 21:23:53,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:53,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:53,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:53,384 INFO L87 Difference]: Start difference. First operand 463 states and 686 transitions. Second operand 4 states. [2019-10-13 21:23:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:53,524 INFO L93 Difference]: Finished difference Result 1349 states and 1997 transitions. [2019-10-13 21:23:53,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:53,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-13 21:23:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:53,531 INFO L225 Difference]: With dead ends: 1349 [2019-10-13 21:23:53,531 INFO L226 Difference]: Without dead ends: 899 [2019-10-13 21:23:53,535 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-13 21:23:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-10-13 21:23:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 897. [2019-10-13 21:23:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-10-13 21:23:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1319 transitions. [2019-10-13 21:23:53,595 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1319 transitions. Word has length 145 [2019-10-13 21:23:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:53,596 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1319 transitions. [2019-10-13 21:23:53,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1319 transitions. [2019-10-13 21:23:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:23:53,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:53,600 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] [2019-10-13 21:23:53,601 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:53,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1132437897, now seen corresponding path program 1 times [2019-10-13 21:23:53,603 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:53,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442990467] [2019-10-13 21:23:53,603 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,603 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:53,728 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-13 21:23:53,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442990467] [2019-10-13 21:23:53,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:53,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:53,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758329444] [2019-10-13 21:23:53,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:53,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:53,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:53,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:53,731 INFO L87 Difference]: Start difference. First operand 897 states and 1319 transitions. Second operand 3 states. [2019-10-13 21:23:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:53,822 INFO L93 Difference]: Finished difference Result 2645 states and 3887 transitions. [2019-10-13 21:23:53,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:53,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-13 21:23:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:53,833 INFO L225 Difference]: With dead ends: 2645 [2019-10-13 21:23:53,833 INFO L226 Difference]: Without dead ends: 1780 [2019-10-13 21:23:53,836 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-13 21:23:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-10-13 21:23:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 899. [2019-10-13 21:23:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-10-13 21:23:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1321 transitions. [2019-10-13 21:23:53,909 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1321 transitions. Word has length 146 [2019-10-13 21:23:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:53,909 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1321 transitions. [2019-10-13 21:23:53,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1321 transitions. [2019-10-13 21:23:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:23:53,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:53,916 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-13 21:23:53,916 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash 18878169, now seen corresponding path program 1 times [2019-10-13 21:23:53,917 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:53,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490168562] [2019-10-13 21:23:53,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:54,090 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-13 21:23:54,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490168562] [2019-10-13 21:23:54,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:54,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:54,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688951860] [2019-10-13 21:23:54,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:54,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:54,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:54,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:54,093 INFO L87 Difference]: Start difference. First operand 899 states and 1321 transitions. Second operand 3 states. [2019-10-13 21:23:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:54,278 INFO L93 Difference]: Finished difference Result 2451 states and 3620 transitions. [2019-10-13 21:23:54,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:54,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-13 21:23:54,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:54,293 INFO L225 Difference]: With dead ends: 2451 [2019-10-13 21:23:54,294 INFO L226 Difference]: Without dead ends: 1734 [2019-10-13 21:23:54,297 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-13 21:23:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-10-13 21:23:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-10-13 21:23:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-10-13 21:23:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2523 transitions. [2019-10-13 21:23:54,474 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2523 transitions. Word has length 147 [2019-10-13 21:23:54,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:54,475 INFO L462 AbstractCegarLoop]: Abstraction has 1732 states and 2523 transitions. [2019-10-13 21:23:54,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2523 transitions. [2019-10-13 21:23:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:23:54,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:54,480 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-13 21:23:54,480 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:54,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1632040732, now seen corresponding path program 1 times [2019-10-13 21:23:54,481 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:54,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225235476] [2019-10-13 21:23:54,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:54,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:54,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:54,665 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-13 21:23:54,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225235476] [2019-10-13 21:23:54,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:54,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:54,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910217876] [2019-10-13 21:23:54,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:54,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:54,669 INFO L87 Difference]: Start difference. First operand 1732 states and 2523 transitions. Second operand 4 states. [2019-10-13 21:23:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:54,782 INFO L93 Difference]: Finished difference Result 2881 states and 4212 transitions. [2019-10-13 21:23:54,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:54,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-13 21:23:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:54,791 INFO L225 Difference]: With dead ends: 2881 [2019-10-13 21:23:54,791 INFO L226 Difference]: Without dead ends: 1321 [2019-10-13 21:23:54,795 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-13 21:23:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-10-13 21:23:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2019-10-13 21:23:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-10-13 21:23:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1916 transitions. [2019-10-13 21:23:54,886 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1916 transitions. Word has length 147 [2019-10-13 21:23:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:54,887 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 1916 transitions. [2019-10-13 21:23:54,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1916 transitions. [2019-10-13 21:23:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:23:54,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:54,893 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-13 21:23:54,893 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:54,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1705432715, now seen corresponding path program 1 times [2019-10-13 21:23:54,894 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:54,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79084175] [2019-10-13 21:23:54,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:54,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:54,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:55,154 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-13 21:23:55,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79084175] [2019-10-13 21:23:55,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:55,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:23:55,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669362725] [2019-10-13 21:23:55,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:23:55,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:55,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:23:55,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:23:55,157 INFO L87 Difference]: Start difference. First operand 1321 states and 1916 transitions. Second operand 8 states. [2019-10-13 21:23:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:56,139 INFO L93 Difference]: Finished difference Result 3867 states and 5900 transitions. [2019-10-13 21:23:56,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:23:56,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-10-13 21:23:56,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:56,159 INFO L225 Difference]: With dead ends: 3867 [2019-10-13 21:23:56,160 INFO L226 Difference]: Without dead ends: 2751 [2019-10-13 21:23:56,166 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-13 21:23:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-10-13 21:23:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 1652. [2019-10-13 21:23:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-10-13 21:23:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2413 transitions. [2019-10-13 21:23:56,321 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2413 transitions. Word has length 150 [2019-10-13 21:23:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:56,322 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 2413 transitions. [2019-10-13 21:23:56,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:23:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2413 transitions. [2019-10-13 21:23:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:23:56,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23: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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:56,328 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:56,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:56,330 INFO L82 PathProgramCache]: Analyzing trace with hash -912214424, now seen corresponding path program 1 times [2019-10-13 21:23:56,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:56,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672810101] [2019-10-13 21:23:56,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:56,586 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-13 21:23:56,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672810101] [2019-10-13 21:23:56,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:56,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:56,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827815094] [2019-10-13 21:23:56,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:56,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:56,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:56,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:56,590 INFO L87 Difference]: Start difference. First operand 1652 states and 2413 transitions. Second operand 4 states. [2019-10-13 21:23:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:56,850 INFO L93 Difference]: Finished difference Result 4332 states and 6340 transitions. [2019-10-13 21:23:56,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:56,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-13 21:23:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:56,871 INFO L225 Difference]: With dead ends: 4332 [2019-10-13 21:23:56,871 INFO L226 Difference]: Without dead ends: 2703 [2019-10-13 21:23:56,876 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-13 21:23:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-10-13 21:23:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2701. [2019-10-13 21:23:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2019-10-13 21:23:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3924 transitions. [2019-10-13 21:23:57,250 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3924 transitions. Word has length 150 [2019-10-13 21:23:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:57,250 INFO L462 AbstractCegarLoop]: Abstraction has 2701 states and 3924 transitions. [2019-10-13 21:23:57,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3924 transitions. [2019-10-13 21:23:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:23:57,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:57,255 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-13 21:23:57,256 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1681251574, now seen corresponding path program 1 times [2019-10-13 21:23:57,256 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:57,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152423812] [2019-10-13 21:23:57,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:57,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:57,379 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-13 21:23:57,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152423812] [2019-10-13 21:23:57,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:57,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:57,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097148375] [2019-10-13 21:23:57,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:57,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:57,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:57,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:57,381 INFO L87 Difference]: Start difference. First operand 2701 states and 3924 transitions. Second operand 3 states. [2019-10-13 21:23:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:57,775 INFO L93 Difference]: Finished difference Result 7038 states and 10298 transitions. [2019-10-13 21:23:57,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:57,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-13 21:23:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:57,803 INFO L225 Difference]: With dead ends: 7038 [2019-10-13 21:23:57,803 INFO L226 Difference]: Without dead ends: 4666 [2019-10-13 21:23:57,809 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-13 21:23:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-10-13 21:23:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4664. [2019-10-13 21:23:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-10-13 21:23:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 6720 transitions. [2019-10-13 21:23:58,148 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 6720 transitions. Word has length 152 [2019-10-13 21:23:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:58,149 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 6720 transitions. [2019-10-13 21:23:58,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 6720 transitions. [2019-10-13 21:23:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:23:58,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:58,156 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-13 21:23:58,157 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash -344412185, now seen corresponding path program 1 times [2019-10-13 21:23:58,158 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:58,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578866477] [2019-10-13 21:23:58,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:58,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:58,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:58,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578866477] [2019-10-13 21:23:58,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:58,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:58,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543256959] [2019-10-13 21:23:58,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:58,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:58,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:58,334 INFO L87 Difference]: Start difference. First operand 4664 states and 6720 transitions. Second operand 4 states. [2019-10-13 21:23:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:58,742 INFO L93 Difference]: Finished difference Result 7769 states and 11256 transitions. [2019-10-13 21:23:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:58,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-13 21:23:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:58,765 INFO L225 Difference]: With dead ends: 7769 [2019-10-13 21:23:58,765 INFO L226 Difference]: Without dead ends: 4098 [2019-10-13 21:23:58,772 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-13 21:23:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-10-13 21:23:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2019-10-13 21:23:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-10-13 21:23:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5895 transitions. [2019-10-13 21:23:59,071 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5895 transitions. Word has length 152 [2019-10-13 21:23:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:59,071 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 5895 transitions. [2019-10-13 21:23:59,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5895 transitions. [2019-10-13 21:23:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:23:59,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:59,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:59,078 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 71132805, now seen corresponding path program 1 times [2019-10-13 21:23:59,079 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:59,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251766008] [2019-10-13 21:23:59,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:59,165 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-13 21:23:59,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251766008] [2019-10-13 21:23:59,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:59,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:59,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447017562] [2019-10-13 21:23:59,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:59,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:59,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:59,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:59,168 INFO L87 Difference]: Start difference. First operand 4098 states and 5895 transitions. Second operand 3 states. [2019-10-13 21:23:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:59,897 INFO L93 Difference]: Finished difference Result 10865 states and 15855 transitions. [2019-10-13 21:23:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:59,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-13 21:23:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:59,935 INFO L225 Difference]: With dead ends: 10865 [2019-10-13 21:23:59,935 INFO L226 Difference]: Without dead ends: 7902 [2019-10-13 21:23:59,944 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-13 21:23:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7902 states. [2019-10-13 21:24:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7902 to 7900. [2019-10-13 21:24:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-10-13 21:24:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 11351 transitions. [2019-10-13 21:24:00,661 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 11351 transitions. Word has length 155 [2019-10-13 21:24:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:00,662 INFO L462 AbstractCegarLoop]: Abstraction has 7900 states and 11351 transitions. [2019-10-13 21:24:00,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 11351 transitions. [2019-10-13 21:24:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:24:00,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:00,673 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:00,673 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:00,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:00,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1126763328, now seen corresponding path program 1 times [2019-10-13 21:24:00,674 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:00,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732751531] [2019-10-13 21:24:00,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:00,877 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-13 21:24:00,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732751531] [2019-10-13 21:24:00,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:00,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:00,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179500992] [2019-10-13 21:24:00,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:00,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:00,879 INFO L87 Difference]: Start difference. First operand 7900 states and 11351 transitions. Second operand 4 states. [2019-10-13 21:24:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:02,081 INFO L93 Difference]: Finished difference Result 23082 states and 33193 transitions. [2019-10-13 21:24:02,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:02,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-13 21:24:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:02,144 INFO L225 Difference]: With dead ends: 23082 [2019-10-13 21:24:02,144 INFO L226 Difference]: Without dead ends: 15225 [2019-10-13 21:24:02,170 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-13 21:24:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15225 states. [2019-10-13 21:24:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15225 to 15223. [2019-10-13 21:24:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15223 states. [2019-10-13 21:24:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15223 states to 15223 states and 21696 transitions. [2019-10-13 21:24:03,596 INFO L78 Accepts]: Start accepts. Automaton has 15223 states and 21696 transitions. Word has length 155 [2019-10-13 21:24:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:03,596 INFO L462 AbstractCegarLoop]: Abstraction has 15223 states and 21696 transitions. [2019-10-13 21:24:03,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 15223 states and 21696 transitions. [2019-10-13 21:24:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:24:03,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:03,618 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] [2019-10-13 21:24:03,619 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1208295678, now seen corresponding path program 1 times [2019-10-13 21:24:03,619 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:03,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6806612] [2019-10-13 21:24:03,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:03,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:03,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:03,693 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-13 21:24:03,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6806612] [2019-10-13 21:24:03,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:03,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:03,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853005111] [2019-10-13 21:24:03,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:03,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:03,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:03,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:03,696 INFO L87 Difference]: Start difference. First operand 15223 states and 21696 transitions. Second operand 3 states. [2019-10-13 21:24:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:05,509 INFO L93 Difference]: Finished difference Result 45469 states and 64831 transitions. [2019-10-13 21:24:05,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:05,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-13 21:24:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:05,594 INFO L225 Difference]: With dead ends: 45469 [2019-10-13 21:24:05,594 INFO L226 Difference]: Without dead ends: 30355 [2019-10-13 21:24:05,634 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-13 21:24:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30355 states. [2019-10-13 21:24:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30355 to 15229. [2019-10-13 21:24:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15229 states. [2019-10-13 21:24:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15229 states to 15229 states and 21702 transitions. [2019-10-13 21:24:06,851 INFO L78 Accepts]: Start accepts. Automaton has 15229 states and 21702 transitions. Word has length 156 [2019-10-13 21:24:06,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:06,851 INFO L462 AbstractCegarLoop]: Abstraction has 15229 states and 21702 transitions. [2019-10-13 21:24:06,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 15229 states and 21702 transitions. [2019-10-13 21:24:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:24:06,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:06,870 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:06,870 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:06,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:06,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1010309857, now seen corresponding path program 1 times [2019-10-13 21:24:06,871 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:06,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971553369] [2019-10-13 21:24:06,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:06,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:06,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:07,020 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-13 21:24:07,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971553369] [2019-10-13 21:24:07,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:07,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:07,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712316535] [2019-10-13 21:24:07,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:07,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:07,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:07,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:07,023 INFO L87 Difference]: Start difference. First operand 15229 states and 21702 transitions. Second operand 4 states. [2019-10-13 21:24:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:08,208 INFO L93 Difference]: Finished difference Result 30416 states and 43348 transitions. [2019-10-13 21:24:08,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:08,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-13 21:24:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:08,259 INFO L225 Difference]: With dead ends: 30416 [2019-10-13 21:24:08,260 INFO L226 Difference]: Without dead ends: 15223 [2019-10-13 21:24:08,300 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-13 21:24:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15223 states. [2019-10-13 21:24:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15223 to 15223. [2019-10-13 21:24:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15223 states. [2019-10-13 21:24:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15223 states to 15223 states and 21690 transitions. [2019-10-13 21:24:09,714 INFO L78 Accepts]: Start accepts. Automaton has 15223 states and 21690 transitions. Word has length 157 [2019-10-13 21:24:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:09,715 INFO L462 AbstractCegarLoop]: Abstraction has 15223 states and 21690 transitions. [2019-10-13 21:24:09,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 15223 states and 21690 transitions. [2019-10-13 21:24:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:24:09,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:09,729 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:09,729 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:09,730 INFO L82 PathProgramCache]: Analyzing trace with hash -702669460, now seen corresponding path program 1 times [2019-10-13 21:24:09,730 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:09,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012958658] [2019-10-13 21:24:09,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:09,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:09,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:09,837 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-13 21:24:09,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012958658] [2019-10-13 21:24:09,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:09,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:09,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837790179] [2019-10-13 21:24:09,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:09,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:09,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:09,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:09,839 INFO L87 Difference]: Start difference. First operand 15223 states and 21690 transitions. Second operand 3 states. [2019-10-13 21:24:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:11,332 INFO L93 Difference]: Finished difference Result 36857 states and 52495 transitions. [2019-10-13 21:24:11,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:11,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-13 21:24:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:11,368 INFO L225 Difference]: With dead ends: 36857 [2019-10-13 21:24:11,369 INFO L226 Difference]: Without dead ends: 22575 [2019-10-13 21:24:11,394 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-13 21:24:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22575 states. [2019-10-13 21:24:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22575 to 22573. [2019-10-13 21:24:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22573 states. [2019-10-13 21:24:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22573 states to 22573 states and 31549 transitions. [2019-10-13 21:24:12,702 INFO L78 Accepts]: Start accepts. Automaton has 22573 states and 31549 transitions. Word has length 157 [2019-10-13 21:24:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:12,702 INFO L462 AbstractCegarLoop]: Abstraction has 22573 states and 31549 transitions. [2019-10-13 21:24:12,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 22573 states and 31549 transitions. [2019-10-13 21:24:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 21:24:12,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:12,721 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:12,721 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:12,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 586917850, now seen corresponding path program 1 times [2019-10-13 21:24:12,722 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:12,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797429527] [2019-10-13 21:24:12,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:12,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:12,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:12,950 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-13 21:24:12,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797429527] [2019-10-13 21:24:12,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:12,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:12,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567020816] [2019-10-13 21:24:12,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:12,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:12,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:12,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:12,954 INFO L87 Difference]: Start difference. First operand 22573 states and 31549 transitions. Second operand 4 states. [2019-10-13 21:24:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:13,974 INFO L93 Difference]: Finished difference Result 42369 states and 59188 transitions. [2019-10-13 21:24:13,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:13,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-13 21:24:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:14,005 INFO L225 Difference]: With dead ends: 42369 [2019-10-13 21:24:14,005 INFO L226 Difference]: Without dead ends: 20147 [2019-10-13 21:24:14,033 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-13 21:24:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20147 states. [2019-10-13 21:24:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20147 to 20078. [2019-10-13 21:24:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20078 states. [2019-10-13 21:24:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20078 states to 20078 states and 27953 transitions. [2019-10-13 21:24:15,238 INFO L78 Accepts]: Start accepts. Automaton has 20078 states and 27953 transitions. Word has length 163 [2019-10-13 21:24:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:15,238 INFO L462 AbstractCegarLoop]: Abstraction has 20078 states and 27953 transitions. [2019-10-13 21:24:15,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20078 states and 27953 transitions. [2019-10-13 21:24:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 21:24:15,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:15,252 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:15,252 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 330827924, now seen corresponding path program 1 times [2019-10-13 21:24:15,252 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:15,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713250867] [2019-10-13 21:24:15,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:15,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:15,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:15,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713250867] [2019-10-13 21:24:15,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:15,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:15,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443426146] [2019-10-13 21:24:15,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:15,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:15,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:15,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:15,465 INFO L87 Difference]: Start difference. First operand 20078 states and 27953 transitions. Second operand 4 states. [2019-10-13 21:24:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:16,754 INFO L93 Difference]: Finished difference Result 40252 states and 56019 transitions. [2019-10-13 21:24:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:16,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-10-13 21:24:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:16,777 INFO L225 Difference]: With dead ends: 40252 [2019-10-13 21:24:16,779 INFO L226 Difference]: Without dead ends: 20329 [2019-10-13 21:24:16,800 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-13 21:24:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20329 states. [2019-10-13 21:24:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20329 to 20223. [2019-10-13 21:24:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20223 states. [2019-10-13 21:24:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20223 states to 20223 states and 28107 transitions. [2019-10-13 21:24:17,777 INFO L78 Accepts]: Start accepts. Automaton has 20223 states and 28107 transitions. Word has length 165 [2019-10-13 21:24:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:17,778 INFO L462 AbstractCegarLoop]: Abstraction has 20223 states and 28107 transitions. [2019-10-13 21:24:17,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 20223 states and 28107 transitions. [2019-10-13 21:24:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-13 21:24:17,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:17,791 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:17,791 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:17,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:17,791 INFO L82 PathProgramCache]: Analyzing trace with hash 721201180, now seen corresponding path program 1 times [2019-10-13 21:24:17,792 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:17,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161312051] [2019-10-13 21:24:17,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:17,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:17,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:17,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161312051] [2019-10-13 21:24:17,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:17,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:17,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652668114] [2019-10-13 21:24:17,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:17,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:17,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:17,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:17,856 INFO L87 Difference]: Start difference. First operand 20223 states and 28107 transitions. Second operand 3 states.