/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.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:07:18,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:07:18,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:07:18,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:07:18,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:07:18,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:07:18,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:07:18,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:07:18,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:07:18,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:07:18,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:07:18,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:07:18,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:07:18,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:07:18,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:07:18,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:07:18,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:07:18,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:07:18,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:07:18,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:07:18,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:07:18,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:07:18,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:07:18,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:07:18,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:07:18,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:07:18,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:07:18,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:07:18,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:07:18,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:07:18,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:07:18,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:07:18,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:07:18,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:07:18,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:07:18,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:07:18,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:07:18,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:07:18,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:07:18,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:07:18,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:07:18,622 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:18,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:07:18,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:07:18,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:07:18,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:07:18,637 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:07:18,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:07:18,638 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:07:18,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:07:18,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:07:18,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:07:18,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:07:18,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:07:18,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:07:18,639 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:07:18,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:07:18,639 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:07:18,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:07:18,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:07:18,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:07:18,640 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:07:18,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:07:18,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:07:18,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:07:18,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:07:18,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:07:18,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:07:18,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:07:18,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:07:18,642 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:18,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:07:18,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:07:18,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:07:18,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:07:18,953 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:07:18,954 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.BOUNDED-10.pals.c [2019-11-07 01:07:19,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b522101d/f051befd0efb4090a9f726de84ed3828/FLAGe06a17c50 [2019-11-07 01:07:19,582 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:07:19,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-11-07 01:07:19,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b522101d/f051befd0efb4090a9f726de84ed3828/FLAGe06a17c50 [2019-11-07 01:07:19,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b522101d/f051befd0efb4090a9f726de84ed3828 [2019-11-07 01:07:19,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:07:19,904 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:07:19,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:19,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:07:19,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:07:19,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:19" (1/1) ... [2019-11-07 01:07:19,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f6f53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:19, skipping insertion in model container [2019-11-07 01:07:19,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:19" (1/1) ... [2019-11-07 01:07:19,922 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:07:19,982 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:07:20,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:20,401 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:07:20,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:20,504 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:07:20,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:20 WrapperNode [2019-11-07 01:07:20,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:20,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:07:20,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:07:20,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:07:20,520 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:20" (1/1) ... [2019-11-07 01:07:20,520 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:20" (1/1) ... [2019-11-07 01:07:20,533 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:20" (1/1) ... [2019-11-07 01:07:20,534 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:20" (1/1) ... [2019-11-07 01:07:20,553 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:20" (1/1) ... [2019-11-07 01:07:20,567 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:20" (1/1) ... [2019-11-07 01:07:20,571 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:20" (1/1) ... [2019-11-07 01:07:20,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:07:20,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:07:20,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:07:20,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:07:20,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:20" (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:20,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:07:20,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:07:20,645 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-11-07 01:07:20,645 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-11-07 01:07:20,645 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-11-07 01:07:20,645 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-11-07 01:07:20,645 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-11-07 01:07:20,645 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-11-07 01:07:20,646 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-11-07 01:07:20,646 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-11-07 01:07:20,646 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-07 01:07:20,646 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-11-07 01:07:20,646 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-11-07 01:07:20,646 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-11-07 01:07:20,647 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-11-07 01:07:20,647 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-11-07 01:07:20,648 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-07 01:07:20,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:07:20,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-11-07 01:07:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:07:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:07:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:07:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:07:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:07:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:07:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:07:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-11-07 01:07:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-11-07 01:07:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-11-07 01:07:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-11-07 01:07:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-11-07 01:07:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-11-07 01:07:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-11-07 01:07:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-11-07 01:07:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:07:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-11-07 01:07:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-11-07 01:07:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-11-07 01:07:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-11-07 01:07:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-11-07 01:07:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:07:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:07:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:07:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:07:21,560 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:07:21,560 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 01:07:21,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:21 BoogieIcfgContainer [2019-11-07 01:07:21,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:07:21,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:07:21,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:07:21,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:07:21,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:07:19" (1/3) ... [2019-11-07 01:07:21,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b516d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:21, skipping insertion in model container [2019-11-07 01:07:21,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:20" (2/3) ... [2019-11-07 01:07:21,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b516d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:21, skipping insertion in model container [2019-11-07 01:07:21,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:21" (3/3) ... [2019-11-07 01:07:21,570 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-11-07 01:07:21,580 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:07:21,588 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:07:21,600 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:07:21,629 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:07:21,629 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:07:21,630 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:07:21,630 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:07:21,630 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:07:21,630 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:07:21,631 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:07:21,631 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:07:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-11-07 01:07:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 01:07:21,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:21,668 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:21,670 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:21,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:21,675 INFO L82 PathProgramCache]: Analyzing trace with hash -512765460, now seen corresponding path program 1 times [2019-11-07 01:07:21,683 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:21,683 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785437306] [2019-11-07 01:07:21,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:22,141 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:22,142 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785437306] [2019-11-07 01:07:22,144 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:22,144 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:22,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886422118] [2019-11-07 01:07:22,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:22,155 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:22,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:22,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:22,175 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 4 states. [2019-11-07 01:07:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:22,323 INFO L93 Difference]: Finished difference Result 455 states and 698 transitions. [2019-11-07 01:07:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:22,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-07 01:07:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:22,342 INFO L225 Difference]: With dead ends: 455 [2019-11-07 01:07:22,342 INFO L226 Difference]: Without dead ends: 232 [2019-11-07 01:07:22,354 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:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-07 01:07:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-11-07 01:07:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-07 01:07:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 324 transitions. [2019-11-07 01:07:22,437 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 324 transitions. Word has length 65 [2019-11-07 01:07:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:22,438 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 324 transitions. [2019-11-07 01:07:22,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 324 transitions. [2019-11-07 01:07:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-07 01:07:22,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:22,442 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:22,443 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:22,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:22,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1221172995, now seen corresponding path program 1 times [2019-11-07 01:07:22,444 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:22,444 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969265188] [2019-11-07 01:07:22,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:22,699 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:22,700 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969265188] [2019-11-07 01:07:22,700 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:22,700 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:22,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93498780] [2019-11-07 01:07:22,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:22,703 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:22,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:22,704 INFO L87 Difference]: Start difference. First operand 232 states and 324 transitions. Second operand 4 states. [2019-11-07 01:07:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:22,806 INFO L93 Difference]: Finished difference Result 446 states and 636 transitions. [2019-11-07 01:07:22,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:22,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-07 01:07:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:22,810 INFO L225 Difference]: With dead ends: 446 [2019-11-07 01:07:22,810 INFO L226 Difference]: Without dead ends: 236 [2019-11-07 01:07:22,812 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:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-07 01:07:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-11-07 01:07:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-07 01:07:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 327 transitions. [2019-11-07 01:07:22,836 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 327 transitions. Word has length 76 [2019-11-07 01:07:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:22,837 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 327 transitions. [2019-11-07 01:07:22,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 327 transitions. [2019-11-07 01:07:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-07 01:07:22,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:22,841 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:22,842 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:22,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:22,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2093661207, now seen corresponding path program 1 times [2019-11-07 01:07:22,842 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:22,842 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665201261] [2019-11-07 01:07:22,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:23,017 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:23,017 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665201261] [2019-11-07 01:07:23,018 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:23,018 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 01:07:23,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157537316] [2019-11-07 01:07:23,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 01:07:23,019 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 01:07:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:07:23,020 INFO L87 Difference]: Start difference. First operand 236 states and 327 transitions. Second operand 7 states. [2019-11-07 01:07:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:24,388 INFO L93 Difference]: Finished difference Result 537 states and 746 transitions. [2019-11-07 01:07:24,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 01:07:24,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-07 01:07:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:24,394 INFO L225 Difference]: With dead ends: 537 [2019-11-07 01:07:24,394 INFO L226 Difference]: Without dead ends: 323 [2019-11-07 01:07:24,395 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:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-07 01:07:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2019-11-07 01:07:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-07 01:07:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2019-11-07 01:07:24,426 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 94 [2019-11-07 01:07:24,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:24,427 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2019-11-07 01:07:24,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 01:07:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2019-11-07 01:07:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-07 01:07:24,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:24,430 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:24,430 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:24,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash 130349043, now seen corresponding path program 1 times [2019-11-07 01:07:24,431 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:24,432 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642273009] [2019-11-07 01:07:24,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:24,584 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:24,585 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642273009] [2019-11-07 01:07:24,585 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:24,585 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 01:07:24,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426890358] [2019-11-07 01:07:24,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 01:07:24,588 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:24,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 01:07:24,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:07:24,590 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand 7 states. [2019-11-07 01:07:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:25,774 INFO L93 Difference]: Finished difference Result 543 states and 754 transitions. [2019-11-07 01:07:25,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 01:07:25,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-07 01:07:25,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:25,780 INFO L225 Difference]: With dead ends: 543 [2019-11-07 01:07:25,780 INFO L226 Difference]: Without dead ends: 326 [2019-11-07 01:07:25,781 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:25,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-07 01:07:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2019-11-07 01:07:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-07 01:07:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2019-11-07 01:07:25,832 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 95 [2019-11-07 01:07:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:25,835 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2019-11-07 01:07:25,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 01:07:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2019-11-07 01:07:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-07 01:07:25,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:25,843 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:25,843 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1810109727, now seen corresponding path program 1 times [2019-11-07 01:07:25,844 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:25,845 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703566269] [2019-11-07 01:07:25,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:25,922 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,923 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703566269] [2019-11-07 01:07:25,923 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:25,923 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:25,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351108403] [2019-11-07 01:07:25,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:25,924 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:25,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:25,925 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand 3 states. [2019-11-07 01:07:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:25,969 INFO L93 Difference]: Finished difference Result 773 states and 1078 transitions. [2019-11-07 01:07:25,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:25,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-07 01:07:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:25,975 INFO L225 Difference]: With dead ends: 773 [2019-11-07 01:07:25,975 INFO L226 Difference]: Without dead ends: 556 [2019-11-07 01:07:25,976 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:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-07 01:07:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 538. [2019-11-07 01:07:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-07 01:07:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 746 transitions. [2019-11-07 01:07:26,023 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 746 transitions. Word has length 97 [2019-11-07 01:07:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:26,024 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 746 transitions. [2019-11-07 01:07:26,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 746 transitions. [2019-11-07 01:07:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 01:07:26,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:26,027 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:26,027 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:26,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1438423074, now seen corresponding path program 1 times [2019-11-07 01:07:26,027 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:26,028 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103978420] [2019-11-07 01:07:26,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:26,110 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:26,111 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103978420] [2019-11-07 01:07:26,111 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:26,112 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:26,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781662706] [2019-11-07 01:07:26,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:26,113 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:26,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:26,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:26,114 INFO L87 Difference]: Start difference. First operand 538 states and 746 transitions. Second operand 3 states. [2019-11-07 01:07:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:26,183 INFO L93 Difference]: Finished difference Result 929 states and 1310 transitions. [2019-11-07 01:07:26,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:26,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-07 01:07:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:26,193 INFO L225 Difference]: With dead ends: 929 [2019-11-07 01:07:26,193 INFO L226 Difference]: Without dead ends: 538 [2019-11-07 01:07:26,196 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:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-07 01:07:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-07 01:07:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-07 01:07:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 745 transitions. [2019-11-07 01:07:26,247 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 745 transitions. Word has length 98 [2019-11-07 01:07:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:26,249 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 745 transitions. [2019-11-07 01:07:26,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 745 transitions. [2019-11-07 01:07:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 01:07:26,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:26,251 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:26,251 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash 737358496, now seen corresponding path program 1 times [2019-11-07 01:07:26,252 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:26,252 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662653438] [2019-11-07 01:07:26,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:26,337 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:26,337 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662653438] [2019-11-07 01:07:26,337 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:26,338 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:26,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758956390] [2019-11-07 01:07:26,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:26,339 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:26,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:26,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:26,339 INFO L87 Difference]: Start difference. First operand 538 states and 745 transitions. Second operand 3 states. [2019-11-07 01:07:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:26,396 INFO L93 Difference]: Finished difference Result 1171 states and 1643 transitions. [2019-11-07 01:07:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:26,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-07 01:07:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:26,403 INFO L225 Difference]: With dead ends: 1171 [2019-11-07 01:07:26,404 INFO L226 Difference]: Without dead ends: 730 [2019-11-07 01:07:26,406 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:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-11-07 01:07:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 724. [2019-11-07 01:07:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-11-07 01:07:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1010 transitions. [2019-11-07 01:07:26,473 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1010 transitions. Word has length 98 [2019-11-07 01:07:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:26,473 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1010 transitions. [2019-11-07 01:07:26,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1010 transitions. [2019-11-07 01:07:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 01:07:26,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:26,475 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:26,476 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:26,476 INFO L82 PathProgramCache]: Analyzing trace with hash -638890142, now seen corresponding path program 1 times [2019-11-07 01:07:26,476 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:26,476 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108100751] [2019-11-07 01:07:26,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:26,576 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:26,576 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108100751] [2019-11-07 01:07:26,577 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:26,577 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:26,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609200718] [2019-11-07 01:07:26,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:26,578 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:26,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:26,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:26,578 INFO L87 Difference]: Start difference. First operand 724 states and 1010 transitions. Second operand 4 states. [2019-11-07 01:07:26,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:26,636 INFO L93 Difference]: Finished difference Result 1312 states and 1857 transitions. [2019-11-07 01:07:26,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:26,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-07 01:07:26,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:26,642 INFO L225 Difference]: With dead ends: 1312 [2019-11-07 01:07:26,643 INFO L226 Difference]: Without dead ends: 739 [2019-11-07 01:07:26,647 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:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-11-07 01:07:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2019-11-07 01:07:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-11-07 01:07:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1022 transitions. [2019-11-07 01:07:26,694 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1022 transitions. Word has length 98 [2019-11-07 01:07:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:26,694 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1022 transitions. [2019-11-07 01:07:26,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1022 transitions. [2019-11-07 01:07:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:07:26,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:26,698 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:26,698 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:26,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:26,699 INFO L82 PathProgramCache]: Analyzing trace with hash -397676862, now seen corresponding path program 1 times [2019-11-07 01:07:26,699 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:26,699 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013088158] [2019-11-07 01:07:26,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:26,816 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:26,817 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013088158] [2019-11-07 01:07:26,817 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:26,818 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:26,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88749076] [2019-11-07 01:07:26,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:26,820 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:26,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:26,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:26,821 INFO L87 Difference]: Start difference. First operand 739 states and 1022 transitions. Second operand 4 states. [2019-11-07 01:07:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:26,919 INFO L93 Difference]: Finished difference Result 1342 states and 1890 transitions. [2019-11-07 01:07:26,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:26,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-07 01:07:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:26,925 INFO L225 Difference]: With dead ends: 1342 [2019-11-07 01:07:26,926 INFO L226 Difference]: Without dead ends: 754 [2019-11-07 01:07:26,929 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:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-11-07 01:07:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-11-07 01:07:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-11-07 01:07:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1034 transitions. [2019-11-07 01:07:26,983 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1034 transitions. Word has length 106 [2019-11-07 01:07:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:26,984 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1034 transitions. [2019-11-07 01:07:26,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1034 transitions. [2019-11-07 01:07:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:07:26,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:26,990 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:26,990 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:26,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:26,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1572879564, now seen corresponding path program 1 times [2019-11-07 01:07:26,991 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:26,991 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090140484] [2019-11-07 01:07:26,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:27,087 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:27,087 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090140484] [2019-11-07 01:07:27,088 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:27,088 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:27,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902348443] [2019-11-07 01:07:27,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:27,090 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:27,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:27,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:27,090 INFO L87 Difference]: Start difference. First operand 754 states and 1034 transitions. Second operand 4 states. [2019-11-07 01:07:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:27,159 INFO L93 Difference]: Finished difference Result 1369 states and 1902 transitions. [2019-11-07 01:07:27,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:27,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-07 01:07:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:27,165 INFO L225 Difference]: With dead ends: 1369 [2019-11-07 01:07:27,165 INFO L226 Difference]: Without dead ends: 766 [2019-11-07 01:07:27,172 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:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-11-07 01:07:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2019-11-07 01:07:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-11-07 01:07:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1043 transitions. [2019-11-07 01:07:27,218 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1043 transitions. Word has length 114 [2019-11-07 01:07:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:27,218 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1043 transitions. [2019-11-07 01:07:27,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1043 transitions. [2019-11-07 01:07:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:07:27,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:27,222 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:27,222 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:27,223 INFO L82 PathProgramCache]: Analyzing trace with hash -156798744, now seen corresponding path program 1 times [2019-11-07 01:07:27,223 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:27,223 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026861658] [2019-11-07 01:07:27,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:27,360 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,361 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026861658] [2019-11-07 01:07:27,361 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:27,361 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:27,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848373995] [2019-11-07 01:07:27,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:27,362 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:27,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:27,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:27,363 INFO L87 Difference]: Start difference. First operand 766 states and 1043 transitions. Second operand 4 states. [2019-11-07 01:07:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:27,437 INFO L93 Difference]: Finished difference Result 1396 states and 1932 transitions. [2019-11-07 01:07:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:27,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-07 01:07:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:27,443 INFO L225 Difference]: With dead ends: 1396 [2019-11-07 01:07:27,443 INFO L226 Difference]: Without dead ends: 781 [2019-11-07 01:07:27,446 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:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-11-07 01:07:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2019-11-07 01:07:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-11-07 01:07:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1055 transitions. [2019-11-07 01:07:27,487 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1055 transitions. Word has length 114 [2019-11-07 01:07:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:27,488 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1055 transitions. [2019-11-07 01:07:27,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1055 transitions. [2019-11-07 01:07:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-07 01:07:27,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:27,491 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:27,491 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1699235052, now seen corresponding path program 1 times [2019-11-07 01:07:27,492 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:27,492 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117857981] [2019-11-07 01:07:27,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:27,577 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:27,577 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117857981] [2019-11-07 01:07:27,577 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:27,578 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:27,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899125651] [2019-11-07 01:07:27,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:27,579 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:27,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:27,579 INFO L87 Difference]: Start difference. First operand 781 states and 1055 transitions. Second operand 4 states. [2019-11-07 01:07:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:27,644 INFO L93 Difference]: Finished difference Result 1429 states and 1953 transitions. [2019-11-07 01:07:27,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:27,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-07 01:07:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:27,651 INFO L225 Difference]: With dead ends: 1429 [2019-11-07 01:07:27,651 INFO L226 Difference]: Without dead ends: 799 [2019-11-07 01:07:27,654 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:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-07 01:07:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2019-11-07 01:07:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-11-07 01:07:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1070 transitions. [2019-11-07 01:07:27,744 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1070 transitions. Word has length 122 [2019-11-07 01:07:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:27,745 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1070 transitions. [2019-11-07 01:07:27,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1070 transitions. [2019-11-07 01:07:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-07 01:07:27,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:27,750 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:27,750 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:27,751 INFO L82 PathProgramCache]: Analyzing trace with hash 820674453, now seen corresponding path program 1 times [2019-11-07 01:07:27,751 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:27,751 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556651027] [2019-11-07 01:07:27,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:28,051 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:28,052 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556651027] [2019-11-07 01:07:28,052 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:28,052 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:07:28,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765415325] [2019-11-07 01:07:28,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:07:28,054 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:28,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:07:28,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:07:28,055 INFO L87 Difference]: Start difference. First operand 799 states and 1070 transitions. Second operand 10 states. [2019-11-07 01:07:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:31,166 INFO L93 Difference]: Finished difference Result 2091 states and 2782 transitions. [2019-11-07 01:07:31,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-07 01:07:31,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-11-07 01:07:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:31,179 INFO L225 Difference]: With dead ends: 2091 [2019-11-07 01:07:31,179 INFO L226 Difference]: Without dead ends: 1434 [2019-11-07 01:07:31,184 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:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-11-07 01:07:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1337. [2019-11-07 01:07:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-11-07 01:07:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1760 transitions. [2019-11-07 01:07:31,347 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1760 transitions. Word has length 127 [2019-11-07 01:07:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:31,348 INFO L462 AbstractCegarLoop]: Abstraction has 1337 states and 1760 transitions. [2019-11-07 01:07:31,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:07:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1760 transitions. [2019-11-07 01:07:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-07 01:07:31,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:31,351 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:31,351 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:31,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:31,352 INFO L82 PathProgramCache]: Analyzing trace with hash -191192024, now seen corresponding path program 1 times [2019-11-07 01:07:31,352 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:31,352 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870224461] [2019-11-07 01:07:31,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:31,470 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:31,470 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870224461] [2019-11-07 01:07:31,471 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:31,471 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:31,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599357313] [2019-11-07 01:07:31,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:31,472 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:31,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:31,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:31,473 INFO L87 Difference]: Start difference. First operand 1337 states and 1760 transitions. Second operand 4 states. [2019-11-07 01:07:31,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:31,595 INFO L93 Difference]: Finished difference Result 2426 states and 3213 transitions. [2019-11-07 01:07:31,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:31,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-11-07 01:07:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:31,610 INFO L225 Difference]: With dead ends: 2426 [2019-11-07 01:07:31,610 INFO L226 Difference]: Without dead ends: 1349 [2019-11-07 01:07:31,618 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:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-11-07 01:07:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1343. [2019-11-07 01:07:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-11-07 01:07:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1747 transitions. [2019-11-07 01:07:31,722 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1747 transitions. Word has length 129 [2019-11-07 01:07:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:31,723 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1747 transitions. [2019-11-07 01:07:31,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1747 transitions. [2019-11-07 01:07:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-07 01:07:31,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:31,726 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:31,726 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:31,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1773246243, now seen corresponding path program 1 times [2019-11-07 01:07:31,727 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:31,727 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938440731] [2019-11-07 01:07:31,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:31,875 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:31,876 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938440731] [2019-11-07 01:07:31,876 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:31,876 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:07:31,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244905299] [2019-11-07 01:07:31,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:07:31,877 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:31,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:07:31,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:31,878 INFO L87 Difference]: Start difference. First operand 1343 states and 1747 transitions. Second operand 9 states. [2019-11-07 01:07:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:33,954 INFO L93 Difference]: Finished difference Result 2767 states and 3573 transitions. [2019-11-07 01:07:33,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 01:07:33,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-11-07 01:07:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:33,966 INFO L225 Difference]: With dead ends: 2767 [2019-11-07 01:07:33,966 INFO L226 Difference]: Without dead ends: 1735 [2019-11-07 01:07:33,972 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:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2019-11-07 01:07:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1466. [2019-11-07 01:07:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2019-11-07 01:07:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1881 transitions. [2019-11-07 01:07:34,062 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1881 transitions. Word has length 131 [2019-11-07 01:07:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:34,062 INFO L462 AbstractCegarLoop]: Abstraction has 1466 states and 1881 transitions. [2019-11-07 01:07:34,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:07:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1881 transitions. [2019-11-07 01:07:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-07 01:07:34,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:34,066 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:34,066 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:34,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:34,067 INFO L82 PathProgramCache]: Analyzing trace with hash 46760133, now seen corresponding path program 1 times [2019-11-07 01:07:34,067 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:34,067 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951683562] [2019-11-07 01:07:34,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:34,280 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:34,287 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951683562] [2019-11-07 01:07:34,290 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:34,290 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:07:34,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209610295] [2019-11-07 01:07:34,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:07:34,292 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:07:34,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:07:34,293 INFO L87 Difference]: Start difference. First operand 1466 states and 1881 transitions. Second operand 8 states. [2019-11-07 01:07:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:34,563 INFO L93 Difference]: Finished difference Result 1567 states and 2024 transitions. [2019-11-07 01:07:34,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 01:07:34,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2019-11-07 01:07:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:34,574 INFO L225 Difference]: With dead ends: 1567 [2019-11-07 01:07:34,575 INFO L226 Difference]: Without dead ends: 1565 [2019-11-07 01:07:34,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-07 01:07:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-11-07 01:07:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1487. [2019-11-07 01:07:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-11-07 01:07:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1904 transitions. [2019-11-07 01:07:34,716 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1904 transitions. Word has length 130 [2019-11-07 01:07:34,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:34,716 INFO L462 AbstractCegarLoop]: Abstraction has 1487 states and 1904 transitions. [2019-11-07 01:07:34,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:07:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1904 transitions. [2019-11-07 01:07:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-07 01:07:34,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:34,720 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:34,720 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash -590455559, now seen corresponding path program 1 times [2019-11-07 01:07:34,720 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:34,721 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985801027] [2019-11-07 01:07:34,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:35,026 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:35,027 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985801027] [2019-11-07 01:07:35,027 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:35,028 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:07:35,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625889243] [2019-11-07 01:07:35,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:07:35,029 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:35,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:07:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:07:35,030 INFO L87 Difference]: Start difference. First operand 1487 states and 1904 transitions. Second operand 10 states. [2019-11-07 01:07:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:38,380 INFO L93 Difference]: Finished difference Result 3893 states and 4953 transitions. [2019-11-07 01:07:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-07 01:07:38,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2019-11-07 01:07:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:38,398 INFO L225 Difference]: With dead ends: 3893 [2019-11-07 01:07:38,398 INFO L226 Difference]: Without dead ends: 2759 [2019-11-07 01:07:38,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-11-07 01:07:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2019-11-07 01:07:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1912. [2019-11-07 01:07:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-11-07 01:07:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2434 transitions. [2019-11-07 01:07:38,570 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2434 transitions. Word has length 135 [2019-11-07 01:07:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:38,571 INFO L462 AbstractCegarLoop]: Abstraction has 1912 states and 2434 transitions. [2019-11-07 01:07:38,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:07:38,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2434 transitions. [2019-11-07 01:07:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-07 01:07:38,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:38,576 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:38,576 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1460592206, now seen corresponding path program 1 times [2019-11-07 01:07:38,577 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:38,577 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758880287] [2019-11-07 01:07:38,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:38,780 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:38,780 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758880287] [2019-11-07 01:07:38,781 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:38,781 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:38,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949847013] [2019-11-07 01:07:38,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:38,782 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:38,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:38,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:38,783 INFO L87 Difference]: Start difference. First operand 1912 states and 2434 transitions. Second operand 5 states. [2019-11-07 01:07:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:39,332 INFO L93 Difference]: Finished difference Result 6600 states and 8502 transitions. [2019-11-07 01:07:39,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:07:39,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-11-07 01:07:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:39,360 INFO L225 Difference]: With dead ends: 6600 [2019-11-07 01:07:39,361 INFO L226 Difference]: Without dead ends: 4986 [2019-11-07 01:07:39,369 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:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2019-11-07 01:07:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 4528. [2019-11-07 01:07:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4528 states. [2019-11-07 01:07:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4528 states to 4528 states and 5778 transitions. [2019-11-07 01:07:39,676 INFO L78 Accepts]: Start accepts. Automaton has 4528 states and 5778 transitions. Word has length 136 [2019-11-07 01:07:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:39,676 INFO L462 AbstractCegarLoop]: Abstraction has 4528 states and 5778 transitions. [2019-11-07 01:07:39,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4528 states and 5778 transitions. [2019-11-07 01:07:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-07 01:07:39,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:39,681 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:39,681 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1163137124, now seen corresponding path program 1 times [2019-11-07 01:07:39,682 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:39,682 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247004913] [2019-11-07 01:07:39,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:39,886 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:39,886 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247004913] [2019-11-07 01:07:39,886 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:39,887 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:07:39,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847687869] [2019-11-07 01:07:39,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:07:39,889 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:39,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:07:39,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:39,890 INFO L87 Difference]: Start difference. First operand 4528 states and 5778 transitions. Second operand 9 states. [2019-11-07 01:07:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:41,223 INFO L93 Difference]: Finished difference Result 7998 states and 10296 transitions. [2019-11-07 01:07:41,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 01:07:41,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-11-07 01:07:41,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:41,246 INFO L225 Difference]: With dead ends: 7998 [2019-11-07 01:07:41,246 INFO L226 Difference]: Without dead ends: 4069 [2019-11-07 01:07:41,260 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:41,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2019-11-07 01:07:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 3502. [2019-11-07 01:07:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3502 states. [2019-11-07 01:07:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 4460 transitions. [2019-11-07 01:07:41,457 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 4460 transitions. Word has length 137 [2019-11-07 01:07:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:41,458 INFO L462 AbstractCegarLoop]: Abstraction has 3502 states and 4460 transitions. [2019-11-07 01:07:41,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:07:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 4460 transitions. [2019-11-07 01:07:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [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, 1, 1] [2019-11-07 01:07:41,461 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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 -548829752, now seen corresponding path program 1 times [2019-11-07 01:07:41,462 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:41,462 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994157984] [2019-11-07 01:07:41,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:41,602 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:41,603 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994157984] [2019-11-07 01:07:41,603 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:41,603 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:07:41,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149725444] [2019-11-07 01:07:41,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:07:41,604 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:41,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:07:41,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:41,605 INFO L87 Difference]: Start difference. First operand 3502 states and 4460 transitions. Second operand 9 states. [2019-11-07 01:07:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:43,296 INFO L93 Difference]: Finished difference Result 7114 states and 9207 transitions. [2019-11-07 01:07:43,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 01:07:43,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2019-11-07 01:07:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:43,318 INFO L225 Difference]: With dead ends: 7114 [2019-11-07 01:07:43,319 INFO L226 Difference]: Without dead ends: 3968 [2019-11-07 01:07:43,329 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:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-11-07 01:07:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3403. [2019-11-07 01:07:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-11-07 01:07:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 4335 transitions. [2019-11-07 01:07:43,538 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 4335 transitions. Word has length 138 [2019-11-07 01:07:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:43,539 INFO L462 AbstractCegarLoop]: Abstraction has 3403 states and 4335 transitions. [2019-11-07 01:07:43,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:07:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4335 transitions. [2019-11-07 01:07:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-07 01:07:43,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:43,543 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:43,543 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:43,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:43,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1954100026, now seen corresponding path program 1 times [2019-11-07 01:07:43,544 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:43,544 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539001104] [2019-11-07 01:07:43,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:43,668 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:43,669 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539001104] [2019-11-07 01:07:43,669 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:43,669 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:43,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154438733] [2019-11-07 01:07:43,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:43,670 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:43,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:43,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:43,671 INFO L87 Difference]: Start difference. First operand 3403 states and 4335 transitions. Second operand 5 states. [2019-11-07 01:07:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:44,349 INFO L93 Difference]: Finished difference Result 10469 states and 13451 transitions. [2019-11-07 01:07:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:07:44,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-11-07 01:07:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:44,402 INFO L225 Difference]: With dead ends: 10469 [2019-11-07 01:07:44,402 INFO L226 Difference]: Without dead ends: 7583 [2019-11-07 01:07:44,413 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:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2019-11-07 01:07:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 5220. [2019-11-07 01:07:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2019-11-07 01:07:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 6641 transitions. [2019-11-07 01:07:44,788 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 6641 transitions. Word has length 139 [2019-11-07 01:07:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:44,789 INFO L462 AbstractCegarLoop]: Abstraction has 5220 states and 6641 transitions. [2019-11-07 01:07:44,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 6641 transitions. [2019-11-07 01:07:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-07 01:07:44,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:44,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] [2019-11-07 01:07:44,795 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:44,796 INFO L82 PathProgramCache]: Analyzing trace with hash 392021161, now seen corresponding path program 1 times [2019-11-07 01:07:44,796 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:44,796 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081828814] [2019-11-07 01:07:44,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:44,930 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:44,931 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081828814] [2019-11-07 01:07:44,931 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:44,931 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:07:44,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612844163] [2019-11-07 01:07:44,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:07:44,933 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:44,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:07:44,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:44,933 INFO L87 Difference]: Start difference. First operand 5220 states and 6641 transitions. Second operand 5 states. [2019-11-07 01:07:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:45,571 INFO L93 Difference]: Finished difference Result 12108 states and 15464 transitions. [2019-11-07 01:07:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:07:45,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-11-07 01:07:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:45,601 INFO L225 Difference]: With dead ends: 12108 [2019-11-07 01:07:45,601 INFO L226 Difference]: Without dead ends: 7544 [2019-11-07 01:07:45,617 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:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2019-11-07 01:07:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 6994. [2019-11-07 01:07:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6994 states. [2019-11-07 01:07:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6994 states to 6994 states and 8852 transitions. [2019-11-07 01:07:46,119 INFO L78 Accepts]: Start accepts. Automaton has 6994 states and 8852 transitions. Word has length 139 [2019-11-07 01:07:46,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:46,119 INFO L462 AbstractCegarLoop]: Abstraction has 6994 states and 8852 transitions. [2019-11-07 01:07:46,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:07:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 6994 states and 8852 transitions. [2019-11-07 01:07:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-07 01:07:46,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:46,124 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:46,124 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:46,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1910003468, now seen corresponding path program 1 times [2019-11-07 01:07:46,124 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:46,125 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614775236] [2019-11-07 01:07:46,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:46,179 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:46,179 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614775236] [2019-11-07 01:07:46,179 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:46,180 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:46,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445710075] [2019-11-07 01:07:46,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:46,181 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:46,182 INFO L87 Difference]: Start difference. First operand 6994 states and 8852 transitions. Second operand 3 states. [2019-11-07 01:07:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:46,715 INFO L93 Difference]: Finished difference Result 13467 states and 17115 transitions. [2019-11-07 01:07:46,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:46,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-07 01:07:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:46,752 INFO L225 Difference]: With dead ends: 13467 [2019-11-07 01:07:46,752 INFO L226 Difference]: Without dead ends: 7063 [2019-11-07 01:07:46,775 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:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7063 states. [2019-11-07 01:07:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7063 to 7000. [2019-11-07 01:07:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7000 states. [2019-11-07 01:07:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7000 states to 7000 states and 8858 transitions. [2019-11-07 01:07:47,424 INFO L78 Accepts]: Start accepts. Automaton has 7000 states and 8858 transitions. Word has length 140 [2019-11-07 01:07:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:47,425 INFO L462 AbstractCegarLoop]: Abstraction has 7000 states and 8858 transitions. [2019-11-07 01:07:47,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 7000 states and 8858 transitions. [2019-11-07 01:07:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:07:47,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:47,429 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:47,430 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1697402299, now seen corresponding path program 1 times [2019-11-07 01:07:47,431 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:47,431 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895382904] [2019-11-07 01:07:47,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:47,748 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 15 [2019-11-07 01:07:47,929 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,929 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895382904] [2019-11-07 01:07:47,929 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:47,929 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 01:07:47,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221049655] [2019-11-07 01:07:47,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 01:07:47,930 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:47,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 01:07:47,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:07:47,931 INFO L87 Difference]: Start difference. First operand 7000 states and 8858 transitions. Second operand 12 states.