/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:07:21,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:07:21,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:07:21,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:07:21,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:07:21,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:07:21,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:07:21,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:07:21,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:07:21,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:07:21,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:07:21,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:07:21,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:07:21,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:07:21,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:07:21,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:07:21,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:07:21,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:07:21,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:07:21,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:07:21,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:07:21,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:07:21,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:07:21,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:07:21,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:07:21,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:07:21,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:07:21,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:07:21,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:07:21,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:07:21,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:07:21,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:07:21,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:07:21,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:07:21,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:07:21,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:07:21,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:07:21,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:07:21,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:07:21,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:07:21,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:07:21,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 01:07:21,557 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:07:21,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:07:21,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:07:21,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:07:21,559 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:07:21,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:07:21,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:07:21,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:07:21,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:07:21,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:07:21,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:07:21,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:07:21,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:07:21,560 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:07:21,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:07:21,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:07:21,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:07:21,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:07:21,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:07:21,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:07:21,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:07:21,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:07:21,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:07:21,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:07:21,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:07:21,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:07:21,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:07:21,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:07:21,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:07:21,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:07:21,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:07:21,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:07:21,888 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:07:21,889 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:07:21,889 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-11-07 01:07:21,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735d8ad0a/334f0317a1c44177bec4f766bdbc55af/FLAG80ac042a9 [2019-11-07 01:07:22,476 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:07:22,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-11-07 01:07:22,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735d8ad0a/334f0317a1c44177bec4f766bdbc55af/FLAG80ac042a9 [2019-11-07 01:07:22,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735d8ad0a/334f0317a1c44177bec4f766bdbc55af [2019-11-07 01:07:22,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:07:22,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:07:22,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:22,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:07:22,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:07:22,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:22" (1/1) ... [2019-11-07 01:07:22,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21431e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:22, skipping insertion in model container [2019-11-07 01:07:22,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:22" (1/1) ... [2019-11-07 01:07:22,806 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:07:22,866 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:07:23,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:23,360 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:07:23,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:23,456 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:07:23,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:23 WrapperNode [2019-11-07 01:07:23,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:23,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:07:23,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:07:23,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:07:23,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:23" (1/1) ... [2019-11-07 01:07:23,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:23" (1/1) ... [2019-11-07 01:07:23,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:23" (1/1) ... [2019-11-07 01:07:23,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:23" (1/1) ... [2019-11-07 01:07:23,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:23" (1/1) ... [2019-11-07 01:07:23,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:23" (1/1) ... [2019-11-07 01:07:23,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:23" (1/1) ... [2019-11-07 01:07:23,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:07:23,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:07:23,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:07:23,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:07:23,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:07:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:07:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:07:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-11-07 01:07:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-11-07 01:07:23,597 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-11-07 01:07:23,598 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-11-07 01:07:23,598 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-11-07 01:07:23,598 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-11-07 01:07:23,598 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-11-07 01:07:23,598 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-11-07 01:07:23,598 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-07 01:07:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-11-07 01:07:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-11-07 01:07:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-11-07 01:07:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-11-07 01:07:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-11-07 01:07:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-07 01:07:23,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:07:23,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-11-07 01:07:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:07:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:07:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:07:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:07:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:07:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:07:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:07:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-11-07 01:07:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-11-07 01:07:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-11-07 01:07:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-11-07 01:07:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-11-07 01:07:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-11-07 01:07:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-11-07 01:07:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-11-07 01:07:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:07:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-11-07 01:07:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-11-07 01:07:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-11-07 01:07:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-11-07 01:07:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-11-07 01:07:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:07:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:07:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:07:23,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:07:24,486 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:07:24,486 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:07:24,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:24 BoogieIcfgContainer [2019-11-07 01:07:24,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:07:24,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:07:24,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:07:24,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:07:24,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:07:22" (1/3) ... [2019-11-07 01:07:24,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b341ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:24, skipping insertion in model container [2019-11-07 01:07:24,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:23" (2/3) ... [2019-11-07 01:07:24,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b341ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:24, skipping insertion in model container [2019-11-07 01:07:24,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:24" (3/3) ... [2019-11-07 01:07:24,500 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-11-07 01:07:24,511 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:07:24,520 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:07:24,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:07:24,563 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:07:24,564 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:07:24,564 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:07:24,564 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:07:24,565 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:07:24,565 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:07:24,565 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:07:24,565 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:07:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-11-07 01:07:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 01:07:24,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:24,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:24,603 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:24,609 INFO L82 PathProgramCache]: Analyzing trace with hash -95402615, now seen corresponding path program 1 times [2019-11-07 01:07:24,620 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:24,620 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436134658] [2019-11-07 01:07:24,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:25,063 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436134658] [2019-11-07 01:07:25,064 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:25,064 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:25,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608463177] [2019-11-07 01:07:25,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:25,073 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:25,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:25,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:25,087 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 4 states. [2019-11-07 01:07:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:25,192 INFO L93 Difference]: Finished difference Result 448 states and 692 transitions. [2019-11-07 01:07:25,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:25,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-07 01:07:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:25,214 INFO L225 Difference]: With dead ends: 448 [2019-11-07 01:07:25,215 INFO L226 Difference]: Without dead ends: 231 [2019-11-07 01:07:25,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-07 01:07:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-11-07 01:07:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-07 01:07:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 323 transitions. [2019-11-07 01:07:25,309 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 323 transitions. Word has length 65 [2019-11-07 01:07:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:25,309 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 323 transitions. [2019-11-07 01:07:25,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2019-11-07 01:07:25,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-07 01:07:25,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:25,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:25,314 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:25,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:25,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1971874243, now seen corresponding path program 1 times [2019-11-07 01:07:25,315 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:25,316 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060087308] [2019-11-07 01:07:25,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:25,557 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060087308] [2019-11-07 01:07:25,557 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:25,557 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:25,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335830182] [2019-11-07 01:07:25,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:25,561 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:25,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:25,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:25,563 INFO L87 Difference]: Start difference. First operand 231 states and 323 transitions. Second operand 4 states. [2019-11-07 01:07:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:25,682 INFO L93 Difference]: Finished difference Result 444 states and 634 transitions. [2019-11-07 01:07:25,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:25,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-07 01:07:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:25,696 INFO L225 Difference]: With dead ends: 444 [2019-11-07 01:07:25,697 INFO L226 Difference]: Without dead ends: 235 [2019-11-07 01:07:25,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-07 01:07:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-11-07 01:07:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-07 01:07:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 326 transitions. [2019-11-07 01:07:25,739 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 326 transitions. Word has length 76 [2019-11-07 01:07:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:25,740 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 326 transitions. [2019-11-07 01:07:25,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 326 transitions. [2019-11-07 01:07:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-07 01:07:25,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:25,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:25,743 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:25,744 INFO L82 PathProgramCache]: Analyzing trace with hash 350215030, now seen corresponding path program 1 times [2019-11-07 01:07:25,744 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:25,744 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285968764] [2019-11-07 01:07:25,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:25,954 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285968764] [2019-11-07 01:07:25,954 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:25,954 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 01:07:25,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563657105] [2019-11-07 01:07:25,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 01:07:25,956 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 01:07:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:07:25,957 INFO L87 Difference]: Start difference. First operand 235 states and 326 transitions. Second operand 7 states. [2019-11-07 01:07:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:27,261 INFO L93 Difference]: Finished difference Result 535 states and 744 transitions. [2019-11-07 01:07:27,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 01:07:27,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-07 01:07:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:27,274 INFO L225 Difference]: With dead ends: 535 [2019-11-07 01:07:27,274 INFO L226 Difference]: Without dead ends: 322 [2019-11-07 01:07:27,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:07:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-07 01:07:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-11-07 01:07:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-07 01:07:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 438 transitions. [2019-11-07 01:07:27,320 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 438 transitions. Word has length 94 [2019-11-07 01:07:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:27,321 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 438 transitions. [2019-11-07 01:07:27,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 01:07:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 438 transitions. [2019-11-07 01:07:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-07 01:07:27,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:27,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:27,324 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:27,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:27,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1125111825, now seen corresponding path program 1 times [2019-11-07 01:07:27,325 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:27,325 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245343542] [2019-11-07 01:07:27,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:27,447 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245343542] [2019-11-07 01:07:27,448 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:27,448 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 01:07:27,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522901588] [2019-11-07 01:07:27,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 01:07:27,449 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:27,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 01:07:27,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:07:27,450 INFO L87 Difference]: Start difference. First operand 321 states and 438 transitions. Second operand 7 states. [2019-11-07 01:07:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:28,611 INFO L93 Difference]: Finished difference Result 541 states and 752 transitions. [2019-11-07 01:07:28,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 01:07:28,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-07 01:07:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:28,617 INFO L225 Difference]: With dead ends: 541 [2019-11-07 01:07:28,617 INFO L226 Difference]: Without dead ends: 325 [2019-11-07 01:07:28,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:07:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-07 01:07:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2019-11-07 01:07:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-07 01:07:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 438 transitions. [2019-11-07 01:07:28,642 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 438 transitions. Word has length 95 [2019-11-07 01:07:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:28,643 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 438 transitions. [2019-11-07 01:07:28,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 01:07:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 438 transitions. [2019-11-07 01:07:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-07 01:07:28,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:28,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:28,646 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:28,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:28,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1068609311, now seen corresponding path program 1 times [2019-11-07 01:07:28,646 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:28,647 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172981860] [2019-11-07 01:07:28,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:28,732 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172981860] [2019-11-07 01:07:28,733 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:28,733 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:28,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53717254] [2019-11-07 01:07:28,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:28,734 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:28,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:28,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:28,735 INFO L87 Difference]: Start difference. First operand 321 states and 438 transitions. Second operand 3 states. [2019-11-07 01:07:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:28,778 INFO L93 Difference]: Finished difference Result 770 states and 1075 transitions. [2019-11-07 01:07:28,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:28,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-07 01:07:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:28,784 INFO L225 Difference]: With dead ends: 770 [2019-11-07 01:07:28,784 INFO L226 Difference]: Without dead ends: 554 [2019-11-07 01:07:28,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-11-07 01:07:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 537. [2019-11-07 01:07:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-07 01:07:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 745 transitions. [2019-11-07 01:07:28,831 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 745 transitions. Word has length 97 [2019-11-07 01:07:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:28,831 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 745 transitions. [2019-11-07 01:07:28,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 745 transitions. [2019-11-07 01:07:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 01:07:28,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:28,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:28,834 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2002189277, now seen corresponding path program 1 times [2019-11-07 01:07:28,834 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:28,835 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225181806] [2019-11-07 01:07:28,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:28,937 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225181806] [2019-11-07 01:07:28,937 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:28,938 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:28,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703986465] [2019-11-07 01:07:28,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:28,939 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:28,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:28,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:28,939 INFO L87 Difference]: Start difference. First operand 537 states and 745 transitions. Second operand 3 states. [2019-11-07 01:07:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:28,976 INFO L93 Difference]: Finished difference Result 927 states and 1308 transitions. [2019-11-07 01:07:28,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:28,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-07 01:07:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:28,981 INFO L225 Difference]: With dead ends: 927 [2019-11-07 01:07:28,982 INFO L226 Difference]: Without dead ends: 537 [2019-11-07 01:07:28,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-11-07 01:07:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2019-11-07 01:07:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-07 01:07:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 744 transitions. [2019-11-07 01:07:29,019 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 744 transitions. Word has length 98 [2019-11-07 01:07:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:29,020 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 744 transitions. [2019-11-07 01:07:29,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 744 transitions. [2019-11-07 01:07:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 01:07:29,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:29,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:29,022 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:29,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:29,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1591713441, now seen corresponding path program 1 times [2019-11-07 01:07:29,023 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:29,023 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221866907] [2019-11-07 01:07:29,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:29,101 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221866907] [2019-11-07 01:07:29,101 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:29,101 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:29,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747405107] [2019-11-07 01:07:29,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:29,102 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:29,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:29,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:29,103 INFO L87 Difference]: Start difference. First operand 537 states and 744 transitions. Second operand 3 states. [2019-11-07 01:07:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:29,161 INFO L93 Difference]: Finished difference Result 1168 states and 1640 transitions. [2019-11-07 01:07:29,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:29,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-07 01:07:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:29,168 INFO L225 Difference]: With dead ends: 1168 [2019-11-07 01:07:29,168 INFO L226 Difference]: Without dead ends: 728 [2019-11-07 01:07:29,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:29,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-11-07 01:07:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 722. [2019-11-07 01:07:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-11-07 01:07:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1008 transitions. [2019-11-07 01:07:29,222 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1008 transitions. Word has length 98 [2019-11-07 01:07:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:29,222 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1008 transitions. [2019-11-07 01:07:29,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1008 transitions. [2019-11-07 01:07:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 01:07:29,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:29,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:29,226 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1901314178, now seen corresponding path program 1 times [2019-11-07 01:07:29,227 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:29,227 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426939474] [2019-11-07 01:07:29,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:29,333 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426939474] [2019-11-07 01:07:29,333 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:29,334 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:29,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996854457] [2019-11-07 01:07:29,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:29,335 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:29,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:29,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:29,335 INFO L87 Difference]: Start difference. First operand 722 states and 1008 transitions. Second operand 4 states. [2019-11-07 01:07:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:29,391 INFO L93 Difference]: Finished difference Result 1308 states and 1853 transitions. [2019-11-07 01:07:29,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:29,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-07 01:07:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:29,397 INFO L225 Difference]: With dead ends: 1308 [2019-11-07 01:07:29,398 INFO L226 Difference]: Without dead ends: 737 [2019-11-07 01:07:29,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-11-07 01:07:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-11-07 01:07:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-07 01:07:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1020 transitions. [2019-11-07 01:07:29,446 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1020 transitions. Word has length 98 [2019-11-07 01:07:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:29,447 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1020 transitions. [2019-11-07 01:07:29,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1020 transitions. [2019-11-07 01:07:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:07:29,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:29,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:29,450 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:29,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:29,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1229557918, now seen corresponding path program 1 times [2019-11-07 01:07:29,450 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:29,450 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198462394] [2019-11-07 01:07:29,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:29,550 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198462394] [2019-11-07 01:07:29,551 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:29,551 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:29,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630549905] [2019-11-07 01:07:29,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:29,553 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:29,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:29,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:29,554 INFO L87 Difference]: Start difference. First operand 737 states and 1020 transitions. Second operand 4 states. [2019-11-07 01:07:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:29,645 INFO L93 Difference]: Finished difference Result 1338 states and 1886 transitions. [2019-11-07 01:07:29,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:29,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-07 01:07:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:29,652 INFO L225 Difference]: With dead ends: 1338 [2019-11-07 01:07:29,652 INFO L226 Difference]: Without dead ends: 752 [2019-11-07 01:07:29,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-11-07 01:07:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2019-11-07 01:07:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-11-07 01:07:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1032 transitions. [2019-11-07 01:07:29,720 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1032 transitions. Word has length 106 [2019-11-07 01:07:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:29,723 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1032 transitions. [2019-11-07 01:07:29,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1032 transitions. [2019-11-07 01:07:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:07:29,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:29,731 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:29,732 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:29,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:29,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1709526252, now seen corresponding path program 1 times [2019-11-07 01:07:29,733 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:29,733 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934925484] [2019-11-07 01:07:29,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:29,862 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934925484] [2019-11-07 01:07:29,864 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:29,864 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:29,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198378904] [2019-11-07 01:07:29,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:29,866 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:29,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:29,867 INFO L87 Difference]: Start difference. First operand 752 states and 1032 transitions. Second operand 4 states. [2019-11-07 01:07:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:29,960 INFO L93 Difference]: Finished difference Result 1365 states and 1898 transitions. [2019-11-07 01:07:29,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:29,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-07 01:07:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:29,969 INFO L225 Difference]: With dead ends: 1365 [2019-11-07 01:07:29,969 INFO L226 Difference]: Without dead ends: 764 [2019-11-07 01:07:29,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-11-07 01:07:30,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2019-11-07 01:07:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-11-07 01:07:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1041 transitions. [2019-11-07 01:07:30,036 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1041 transitions. Word has length 114 [2019-11-07 01:07:30,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:30,037 INFO L462 AbstractCegarLoop]: Abstraction has 764 states and 1041 transitions. [2019-11-07 01:07:30,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1041 transitions. [2019-11-07 01:07:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:07:30,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:30,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:30,042 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash -20152056, now seen corresponding path program 1 times [2019-11-07 01:07:30,043 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:30,043 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022728740] [2019-11-07 01:07:30,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:30,168 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022728740] [2019-11-07 01:07:30,168 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:30,168 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:30,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029265520] [2019-11-07 01:07:30,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:30,169 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:30,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:30,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:30,170 INFO L87 Difference]: Start difference. First operand 764 states and 1041 transitions. Second operand 4 states. [2019-11-07 01:07:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:30,249 INFO L93 Difference]: Finished difference Result 1392 states and 1928 transitions. [2019-11-07 01:07:30,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:30,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-07 01:07:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:30,256 INFO L225 Difference]: With dead ends: 1392 [2019-11-07 01:07:30,256 INFO L226 Difference]: Without dead ends: 779 [2019-11-07 01:07:30,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-07 01:07:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2019-11-07 01:07:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-11-07 01:07:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1053 transitions. [2019-11-07 01:07:30,306 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1053 transitions. Word has length 114 [2019-11-07 01:07:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:30,306 INFO L462 AbstractCegarLoop]: Abstraction has 779 states and 1053 transitions. [2019-11-07 01:07:30,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1053 transitions. [2019-11-07 01:07:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-07 01:07:30,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:30,311 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:30,311 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:30,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:30,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1453300596, now seen corresponding path program 1 times [2019-11-07 01:07:30,312 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:30,312 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972263576] [2019-11-07 01:07:30,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:07:30,413 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972263576] [2019-11-07 01:07:30,413 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:30,414 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:30,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700635638] [2019-11-07 01:07:30,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:30,414 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:30,415 INFO L87 Difference]: Start difference. First operand 779 states and 1053 transitions. Second operand 4 states. [2019-11-07 01:07:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:30,519 INFO L93 Difference]: Finished difference Result 1425 states and 1949 transitions. [2019-11-07 01:07:30,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:30,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-07 01:07:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:30,525 INFO L225 Difference]: With dead ends: 1425 [2019-11-07 01:07:30,526 INFO L226 Difference]: Without dead ends: 797 [2019-11-07 01:07:30,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-07 01:07:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-11-07 01:07:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-07 01:07:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1068 transitions. [2019-11-07 01:07:30,574 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1068 transitions. Word has length 122 [2019-11-07 01:07:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:30,575 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1068 transitions. [2019-11-07 01:07:30,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1068 transitions. [2019-11-07 01:07:30,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-07 01:07:30,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:30,578 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:30,578 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:30,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1290490955, now seen corresponding path program 1 times [2019-11-07 01:07:30,579 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:30,581 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862570190] [2019-11-07 01:07:30,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:07:30,843 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862570190] [2019-11-07 01:07:30,843 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:30,843 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:07:30,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916641119] [2019-11-07 01:07:30,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:07:30,844 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:30,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:07:30,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:07:30,845 INFO L87 Difference]: Start difference. First operand 797 states and 1068 transitions. Second operand 10 states. [2019-11-07 01:07:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:34,112 INFO L93 Difference]: Finished difference Result 2083 states and 2774 transitions. [2019-11-07 01:07:34,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-07 01:07:34,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-11-07 01:07:34,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:34,123 INFO L225 Difference]: With dead ends: 2083 [2019-11-07 01:07:34,123 INFO L226 Difference]: Without dead ends: 1428 [2019-11-07 01:07:34,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-11-07 01:07:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-07 01:07:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1335. [2019-11-07 01:07:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2019-11-07 01:07:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1758 transitions. [2019-11-07 01:07:34,215 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1758 transitions. Word has length 127 [2019-11-07 01:07:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:34,216 INFO L462 AbstractCegarLoop]: Abstraction has 1335 states and 1758 transitions. [2019-11-07 01:07:34,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:07:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1758 transitions. [2019-11-07 01:07:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-07 01:07:34,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:34,219 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:34,219 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1610878183, now seen corresponding path program 1 times [2019-11-07 01:07:34,219 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:34,220 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566719020] [2019-11-07 01:07:34,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:07:34,301 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566719020] [2019-11-07 01:07:34,302 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:34,302 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:34,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742595280] [2019-11-07 01:07:34,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:34,303 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:34,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:34,303 INFO L87 Difference]: Start difference. First operand 1335 states and 1758 transitions. Second operand 4 states. [2019-11-07 01:07:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:34,386 INFO L93 Difference]: Finished difference Result 2422 states and 3209 transitions. [2019-11-07 01:07:34,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:34,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-11-07 01:07:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:34,394 INFO L225 Difference]: With dead ends: 2422 [2019-11-07 01:07:34,394 INFO L226 Difference]: Without dead ends: 1347 [2019-11-07 01:07:34,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-11-07 01:07:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1341. [2019-11-07 01:07:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2019-11-07 01:07:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1745 transitions. [2019-11-07 01:07:34,469 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1745 transitions. Word has length 129 [2019-11-07 01:07:34,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:34,470 INFO L462 AbstractCegarLoop]: Abstraction has 1341 states and 1745 transitions. [2019-11-07 01:07:34,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1745 transitions. [2019-11-07 01:07:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-07 01:07:34,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:34,473 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:34,473 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:34,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1804269052, now seen corresponding path program 1 times [2019-11-07 01:07:34,474 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:34,474 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503018026] [2019-11-07 01:07:34,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-07 01:07:34,625 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503018026] [2019-11-07 01:07:34,625 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:34,625 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:07:34,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100805928] [2019-11-07 01:07:34,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:07:34,626 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:34,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:07:34,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:34,627 INFO L87 Difference]: Start difference. First operand 1341 states and 1745 transitions. Second operand 9 states. [2019-11-07 01:07:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:36,732 INFO L93 Difference]: Finished difference Result 2761 states and 3567 transitions. [2019-11-07 01:07:36,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 01:07:36,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-11-07 01:07:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:36,745 INFO L225 Difference]: With dead ends: 2761 [2019-11-07 01:07:36,745 INFO L226 Difference]: Without dead ends: 1731 [2019-11-07 01:07:36,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-07 01:07:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2019-11-07 01:07:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1464. [2019-11-07 01:07:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-11-07 01:07:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1879 transitions. [2019-11-07 01:07:36,846 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1879 transitions. Word has length 131 [2019-11-07 01:07:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:36,847 INFO L462 AbstractCegarLoop]: Abstraction has 1464 states and 1879 transitions. [2019-11-07 01:07:36,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:07:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1879 transitions. [2019-11-07 01:07:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-07 01:07:36,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:36,850 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:36,851 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:36,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:36,851 INFO L82 PathProgramCache]: Analyzing trace with hash 77285222, now seen corresponding path program 1 times [2019-11-07 01:07:36,851 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:36,852 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39097475] [2019-11-07 01:07:36,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-07 01:07:36,991 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39097475] [2019-11-07 01:07:36,991 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:36,991 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 01:07:36,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035660982] [2019-11-07 01:07:36,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 01:07:36,993 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:36,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 01:07:36,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:07:36,994 INFO L87 Difference]: Start difference. First operand 1464 states and 1879 transitions. Second operand 7 states. [2019-11-07 01:07:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:37,122 INFO L93 Difference]: Finished difference Result 1563 states and 2020 transitions. [2019-11-07 01:07:37,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 01:07:37,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-11-07 01:07:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:37,133 INFO L225 Difference]: With dead ends: 1563 [2019-11-07 01:07:37,134 INFO L226 Difference]: Without dead ends: 1561 [2019-11-07 01:07:37,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2019-11-07 01:07:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1485. [2019-11-07 01:07:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2019-11-07 01:07:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1902 transitions. [2019-11-07 01:07:37,227 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1902 transitions. Word has length 130 [2019-11-07 01:07:37,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:37,227 INFO L462 AbstractCegarLoop]: Abstraction has 1485 states and 1902 transitions. [2019-11-07 01:07:37,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 01:07:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1902 transitions. [2019-11-07 01:07:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-07 01:07:37,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:37,231 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:37,231 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1402644889, now seen corresponding path program 1 times [2019-11-07 01:07:37,232 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:37,232 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056506365] [2019-11-07 01:07:37,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-07 01:07:37,452 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056506365] [2019-11-07 01:07:37,453 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:37,453 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:07:37,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540257834] [2019-11-07 01:07:37,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:07:37,454 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:07:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:07:37,455 INFO L87 Difference]: Start difference. First operand 1485 states and 1902 transitions. Second operand 10 states. [2019-11-07 01:07:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:41,208 INFO L93 Difference]: Finished difference Result 3885 states and 4945 transitions. [2019-11-07 01:07:41,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-07 01:07:41,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2019-11-07 01:07:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:41,230 INFO L225 Difference]: With dead ends: 3885 [2019-11-07 01:07:41,231 INFO L226 Difference]: Without dead ends: 2753 [2019-11-07 01:07:41,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-11-07 01:07:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2019-11-07 01:07:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 1910. [2019-11-07 01:07:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-11-07 01:07:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2432 transitions. [2019-11-07 01:07:41,455 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2432 transitions. Word has length 135 [2019-11-07 01:07:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:41,456 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2432 transitions. [2019-11-07 01:07:41,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:07:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2432 transitions. [2019-11-07 01:07:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-07 01:07:41,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:41,461 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:41,461 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:41,462 INFO L82 PathProgramCache]: Analyzing trace with hash 168273907, now seen corresponding path program 1 times [2019-11-07 01:07:41,463 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:41,463 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439968782] [2019-11-07 01:07:41,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:07:41,663 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439968782] [2019-11-07 01:07:41,664 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:41,664 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:41,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475659566] [2019-11-07 01:07:41,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:41,665 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:41,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:41,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:41,667 INFO L87 Difference]: Start difference. First operand 1910 states and 2432 transitions. Second operand 5 states. [2019-11-07 01:07:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:42,184 INFO L93 Difference]: Finished difference Result 6592 states and 8494 transitions. [2019-11-07 01:07:42,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:07:42,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-11-07 01:07:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:42,213 INFO L225 Difference]: With dead ends: 6592 [2019-11-07 01:07:42,213 INFO L226 Difference]: Without dead ends: 4980 [2019-11-07 01:07:42,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:07:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4980 states. [2019-11-07 01:07:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4980 to 4524. [2019-11-07 01:07:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4524 states. [2019-11-07 01:07:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5774 transitions. [2019-11-07 01:07:42,533 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5774 transitions. Word has length 136 [2019-11-07 01:07:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:42,533 INFO L462 AbstractCegarLoop]: Abstraction has 4524 states and 5774 transitions. [2019-11-07 01:07:42,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5774 transitions. [2019-11-07 01:07:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-07 01:07:42,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:42,538 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:42,538 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:42,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1315725243, now seen corresponding path program 1 times [2019-11-07 01:07:42,539 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:42,539 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568391244] [2019-11-07 01:07:42,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:07:42,654 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568391244] [2019-11-07 01:07:42,654 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:42,654 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:42,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655142735] [2019-11-07 01:07:42,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:42,655 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:42,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:42,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:42,656 INFO L87 Difference]: Start difference. First operand 4524 states and 5774 transitions. Second operand 4 states. [2019-11-07 01:07:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:43,145 INFO L93 Difference]: Finished difference Result 8486 states and 10861 transitions. [2019-11-07 01:07:43,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:43,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-07 01:07:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:43,171 INFO L225 Difference]: With dead ends: 8486 [2019-11-07 01:07:43,171 INFO L226 Difference]: Without dead ends: 4561 [2019-11-07 01:07:43,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4561 states. [2019-11-07 01:07:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4561 to 4138. [2019-11-07 01:07:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4138 states. [2019-11-07 01:07:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 5281 transitions. [2019-11-07 01:07:43,403 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 5281 transitions. Word has length 140 [2019-11-07 01:07:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:43,404 INFO L462 AbstractCegarLoop]: Abstraction has 4138 states and 5281 transitions. [2019-11-07 01:07:43,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 5281 transitions. [2019-11-07 01:07:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-07 01:07:43,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:43,407 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:43,407 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2010406403, now seen corresponding path program 1 times [2019-11-07 01:07:43,407 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:43,408 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018769870] [2019-11-07 01:07:43,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 01:07:43,600 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018769870] [2019-11-07 01:07:43,601 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:43,601 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:07:43,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42887880] [2019-11-07 01:07:43,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:07:43,602 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:43,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:07:43,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:43,603 INFO L87 Difference]: Start difference. First operand 4138 states and 5281 transitions. Second operand 9 states. [2019-11-07 01:07:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:44,968 INFO L93 Difference]: Finished difference Result 7576 states and 9734 transitions. [2019-11-07 01:07:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 01:07:44,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-11-07 01:07:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:45,007 INFO L225 Difference]: With dead ends: 7576 [2019-11-07 01:07:45,008 INFO L226 Difference]: Without dead ends: 3855 [2019-11-07 01:07:45,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-07 01:07:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3855 states. [2019-11-07 01:07:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3855 to 3498. [2019-11-07 01:07:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3498 states. [2019-11-07 01:07:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 4456 transitions. [2019-11-07 01:07:45,266 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 4456 transitions. Word has length 137 [2019-11-07 01:07:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:45,266 INFO L462 AbstractCegarLoop]: Abstraction has 3498 states and 4456 transitions. [2019-11-07 01:07:45,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:07:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4456 transitions. [2019-11-07 01:07:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-07 01:07:45,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:45,269 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:45,270 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:45,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:45,270 INFO L82 PathProgramCache]: Analyzing trace with hash 536828905, now seen corresponding path program 1 times [2019-11-07 01:07:45,270 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:45,271 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066448628] [2019-11-07 01:07:45,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 01:07:45,414 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066448628] [2019-11-07 01:07:45,414 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:45,415 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:07:45,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143205962] [2019-11-07 01:07:45,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:07:45,416 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:45,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:07:45,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:45,416 INFO L87 Difference]: Start difference. First operand 3498 states and 4456 transitions. Second operand 9 states. [2019-11-07 01:07:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:47,011 INFO L93 Difference]: Finished difference Result 7105 states and 9198 transitions. [2019-11-07 01:07:47,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 01:07:47,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2019-11-07 01:07:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:47,032 INFO L225 Difference]: With dead ends: 7105 [2019-11-07 01:07:47,033 INFO L226 Difference]: Without dead ends: 3963 [2019-11-07 01:07:47,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-11-07 01:07:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2019-11-07 01:07:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3399. [2019-11-07 01:07:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3399 states. [2019-11-07 01:07:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4331 transitions. [2019-11-07 01:07:47,263 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4331 transitions. Word has length 138 [2019-11-07 01:07:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:47,263 INFO L462 AbstractCegarLoop]: Abstraction has 3399 states and 4331 transitions. [2019-11-07 01:07:47,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:07:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4331 transitions. [2019-11-07 01:07:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-07 01:07:47,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:47,269 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:47,269 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:47,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1537146296, now seen corresponding path program 1 times [2019-11-07 01:07:47,270 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:47,270 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192533990] [2019-11-07 01:07:47,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:07:47,358 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192533990] [2019-11-07 01:07:47,358 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:47,358 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:47,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059774789] [2019-11-07 01:07:47,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:47,359 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:47,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:47,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:47,360 INFO L87 Difference]: Start difference. First operand 3399 states and 4331 transitions. Second operand 5 states. [2019-11-07 01:07:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:48,245 INFO L93 Difference]: Finished difference Result 10453 states and 13435 transitions. [2019-11-07 01:07:48,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:07:48,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-11-07 01:07:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:48,284 INFO L225 Difference]: With dead ends: 10453 [2019-11-07 01:07:48,284 INFO L226 Difference]: Without dead ends: 7571 [2019-11-07 01:07:48,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:07:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-11-07 01:07:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 5216. [2019-11-07 01:07:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5216 states. [2019-11-07 01:07:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 6637 transitions. [2019-11-07 01:07:48,640 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 6637 transitions. Word has length 139 [2019-11-07 01:07:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:48,641 INFO L462 AbstractCegarLoop]: Abstraction has 5216 states and 6637 transitions. [2019-11-07 01:07:48,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:48,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 6637 transitions. [2019-11-07 01:07:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-07 01:07:48,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:48,645 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:48,645 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash -541847865, now seen corresponding path program 1 times [2019-11-07 01:07:48,646 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:48,646 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589066877] [2019-11-07 01:07:48,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:07:48,748 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589066877] [2019-11-07 01:07:48,748 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:48,748 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:48,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333005063] [2019-11-07 01:07:48,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:48,750 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:48,751 INFO L87 Difference]: Start difference. First operand 5216 states and 6637 transitions. Second operand 5 states. [2019-11-07 01:07:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:49,352 INFO L93 Difference]: Finished difference Result 12095 states and 15451 transitions. [2019-11-07 01:07:49,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:07:49,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-11-07 01:07:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:49,377 INFO L225 Difference]: With dead ends: 12095 [2019-11-07 01:07:49,377 INFO L226 Difference]: Without dead ends: 7535 [2019-11-07 01:07:49,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:07:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7535 states. [2019-11-07 01:07:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7535 to 6989. [2019-11-07 01:07:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6989 states. [2019-11-07 01:07:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6989 states to 6989 states and 8847 transitions. [2019-11-07 01:07:49,791 INFO L78 Accepts]: Start accepts. Automaton has 6989 states and 8847 transitions. Word has length 139 [2019-11-07 01:07:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:49,791 INFO L462 AbstractCegarLoop]: Abstraction has 6989 states and 8847 transitions. [2019-11-07 01:07:49,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 6989 states and 8847 transitions. [2019-11-07 01:07:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-07 01:07:49,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:49,795 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:49,796 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:49,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:49,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1241684620, now seen corresponding path program 1 times [2019-11-07 01:07:49,796 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:49,796 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246136397] [2019-11-07 01:07:49,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:07:49,849 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246136397] [2019-11-07 01:07:49,849 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:49,849 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:49,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839912983] [2019-11-07 01:07:49,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:49,850 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:49,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:49,851 INFO L87 Difference]: Start difference. First operand 6989 states and 8847 transitions. Second operand 3 states. [2019-11-07 01:07:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:50,281 INFO L93 Difference]: Finished difference Result 13457 states and 17105 transitions. [2019-11-07 01:07:50,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:50,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-07 01:07:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:50,304 INFO L225 Difference]: With dead ends: 13457 [2019-11-07 01:07:50,304 INFO L226 Difference]: Without dead ends: 7058 [2019-11-07 01:07:50,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2019-11-07 01:07:50,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 6995. [2019-11-07 01:07:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6995 states. [2019-11-07 01:07:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 8853 transitions. [2019-11-07 01:07:50,733 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 8853 transitions. Word has length 140 [2019-11-07 01:07:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:50,733 INFO L462 AbstractCegarLoop]: Abstraction has 6995 states and 8853 transitions. [2019-11-07 01:07:50,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 8853 transitions. [2019-11-07 01:07:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:07:50,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:50,738 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:50,738 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:50,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:50,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1911015683, now seen corresponding path program 1 times [2019-11-07 01:07:50,738 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:50,739 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747232870] [2019-11-07 01:07:50,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:07:51,063 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747232870] [2019-11-07 01:07:51,063 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:51,064 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 01:07:51,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444447509] [2019-11-07 01:07:51,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 01:07:51,066 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:51,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 01:07:51,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:07:51,066 INFO L87 Difference]: Start difference. First operand 6995 states and 8853 transitions. Second operand 12 states.