/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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:43:24,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:43:24,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:43:24,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:43:24,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:43:24,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:43:24,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:43:24,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:43:24,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:43:24,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:43:24,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:43:24,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:43:24,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:43:24,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:43:24,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:43:24,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:43:24,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:43:24,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:43:24,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:43:24,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:43:24,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:43:24,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:43:24,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:43:24,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:43:24,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:43:24,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:43:24,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:43:24,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:43:24,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:43:24,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:43:24,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:43:24,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:43:24,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:43:24,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:43:24,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:43:24,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:43:24,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:43:24,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:43:24,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:43:24,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:43:24,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:43:24,608 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 04:43:24,627 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:43:24,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:43:24,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:43:24,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:43:24,629 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:43:24,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:43:24,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:43:24,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:43:24,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:43:24,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:43:24,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:43:24,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:43:24,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:43:24,630 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:43:24,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:43:24,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:43:24,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:43:24,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:43:24,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:43:24,632 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:43:24,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:43:24,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:43:24,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:43:24,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:43:24,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:43:24,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:43:24,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:43:24,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:43:24,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 04:43:24,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:43:24,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:43:24,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:43:24,922 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:43:24,923 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:43:24,923 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-07 04:43:24,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d400a94a8/0a0dd00f490743d581d976dc0c39fe55/FLAGe1d244a5e [2019-11-07 04:43:25,484 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:43:25,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-07 04:43:25,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d400a94a8/0a0dd00f490743d581d976dc0c39fe55/FLAGe1d244a5e [2019-11-07 04:43:25,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d400a94a8/0a0dd00f490743d581d976dc0c39fe55 [2019-11-07 04:43:25,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:43:25,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:43:25,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:43:25,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:43:25,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:43:25,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:43:25" (1/1) ... [2019-11-07 04:43:25,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5c0553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:25, skipping insertion in model container [2019-11-07 04:43:25,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:43:25" (1/1) ... [2019-11-07 04:43:25,859 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:43:25,915 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:43:26,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:43:26,402 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:43:26,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:43:26,562 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:43:26,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:26 WrapperNode [2019-11-07 04:43:26,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:43:26,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:43:26,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:43:26,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:43:26,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:26" (1/1) ... [2019-11-07 04:43:26,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:26" (1/1) ... [2019-11-07 04:43:26,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:26" (1/1) ... [2019-11-07 04:43:26,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:26" (1/1) ... [2019-11-07 04:43:26,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:26" (1/1) ... [2019-11-07 04:43:26,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:26" (1/1) ... [2019-11-07 04:43:26,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:26" (1/1) ... [2019-11-07 04:43:26,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:43:26,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:43:26,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:43:26,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:43:26,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:26" (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 04:43:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:43:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:43:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-11-07 04:43:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-11-07 04:43:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-11-07 04:43:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-11-07 04:43:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-11-07 04:43:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-07 04:43:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-07 04:43:26,724 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-11-07 04:43:26,724 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-11-07 04:43:26,725 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-11-07 04:43:26,725 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-11-07 04:43:26,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:43:26,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-11-07 04:43:26,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:43:26,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:43:26,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:43:26,728 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:43:26,729 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:43:26,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:43:26,729 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:43:26,729 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-11-07 04:43:26,729 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-11-07 04:43:26,729 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-11-07 04:43:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-11-07 04:43:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-11-07 04:43:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:43:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:43:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-11-07 04:43:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-11-07 04:43:26,730 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-11-07 04:43:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-11-07 04:43:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:43:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:43:26,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:43:28,024 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:43:28,025 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-07 04:43:28,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:43:28 BoogieIcfgContainer [2019-11-07 04:43:28,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:43:28,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:43:28,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:43:28,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:43:28,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:43:25" (1/3) ... [2019-11-07 04:43:28,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d1fd3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:43:28, skipping insertion in model container [2019-11-07 04:43:28,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:26" (2/3) ... [2019-11-07 04:43:28,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d1fd3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:43:28, skipping insertion in model container [2019-11-07 04:43:28,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:43:28" (3/3) ... [2019-11-07 04:43:28,035 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-11-07 04:43:28,045 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:43:28,053 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:43:28,065 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:43:28,091 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:43:28,091 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:43:28,091 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:43:28,091 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:43:28,092 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:43:28,092 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:43:28,092 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:43:28,092 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:43:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2019-11-07 04:43:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 04:43:28,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:28,124 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] [2019-11-07 04:43:28,126 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:28,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:28,132 INFO L82 PathProgramCache]: Analyzing trace with hash 758147934, now seen corresponding path program 1 times [2019-11-07 04:43:28,141 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:28,142 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037934845] [2019-11-07 04:43:28,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:28,417 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 04:43:28,419 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037934845] [2019-11-07 04:43:28,420 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:28,421 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:43:28,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463125260] [2019-11-07 04:43:28,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:43:28,429 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:28,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:43:28,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:43:28,447 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 4 states. [2019-11-07 04:43:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:28,657 INFO L93 Difference]: Finished difference Result 320 states and 504 transitions. [2019-11-07 04:43:28,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:28,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-07 04:43:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:28,685 INFO L225 Difference]: With dead ends: 320 [2019-11-07 04:43:28,685 INFO L226 Difference]: Without dead ends: 164 [2019-11-07 04:43:28,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-07 04:43:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-11-07 04:43:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-07 04:43:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 231 transitions. [2019-11-07 04:43:28,816 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 231 transitions. Word has length 20 [2019-11-07 04:43:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:28,816 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 231 transitions. [2019-11-07 04:43:28,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:43:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 231 transitions. [2019-11-07 04:43:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 04:43:28,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:28,820 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] [2019-11-07 04:43:28,820 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash 658096871, now seen corresponding path program 1 times [2019-11-07 04:43:28,822 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:28,822 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782528165] [2019-11-07 04:43:28,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:28,915 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 04:43:28,915 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782528165] [2019-11-07 04:43:28,916 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:28,916 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:43:28,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121232177] [2019-11-07 04:43:28,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:43:28,918 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:28,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:43:28,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:43:28,919 INFO L87 Difference]: Start difference. First operand 162 states and 231 transitions. Second operand 4 states. [2019-11-07 04:43:28,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:28,987 INFO L93 Difference]: Finished difference Result 330 states and 478 transitions. [2019-11-07 04:43:28,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:28,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-07 04:43:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:28,991 INFO L225 Difference]: With dead ends: 330 [2019-11-07 04:43:28,991 INFO L226 Difference]: Without dead ends: 176 [2019-11-07 04:43:28,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-07 04:43:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2019-11-07 04:43:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-07 04:43:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 246 transitions. [2019-11-07 04:43:29,028 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 246 transitions. Word has length 21 [2019-11-07 04:43:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:29,028 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 246 transitions. [2019-11-07 04:43:29,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:43:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2019-11-07 04:43:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 04:43:29,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:29,031 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-07 04:43:29,031 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1614839382, now seen corresponding path program 1 times [2019-11-07 04:43:29,032 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:29,032 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416729737] [2019-11-07 04:43:29,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:43:29,115 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416729737] [2019-11-07 04:43:29,115 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:29,115 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:43:29,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808344036] [2019-11-07 04:43:29,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:43:29,116 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:29,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:43:29,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:43:29,117 INFO L87 Difference]: Start difference. First operand 174 states and 246 transitions. Second operand 3 states. [2019-11-07 04:43:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:29,142 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2019-11-07 04:43:29,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:43:29,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 04:43:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:29,146 INFO L225 Difference]: With dead ends: 362 [2019-11-07 04:43:29,146 INFO L226 Difference]: Without dead ends: 203 [2019-11-07 04:43:29,147 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 04:43:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-07 04:43:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2019-11-07 04:43:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-07 04:43:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2019-11-07 04:43:29,166 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 28 [2019-11-07 04:43:29,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:29,166 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2019-11-07 04:43:29,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:43:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2019-11-07 04:43:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 04:43:29,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:29,169 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] [2019-11-07 04:43:29,169 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1162341358, now seen corresponding path program 1 times [2019-11-07 04:43:29,170 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:29,170 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332790350] [2019-11-07 04:43:29,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:29,237 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 04:43:29,237 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332790350] [2019-11-07 04:43:29,237 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:29,237 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:43:29,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100641111] [2019-11-07 04:43:29,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:43:29,238 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:29,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:43:29,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:29,239 INFO L87 Difference]: Start difference. First operand 176 states and 248 transitions. Second operand 5 states. [2019-11-07 04:43:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:29,294 INFO L93 Difference]: Finished difference Result 340 states and 483 transitions. [2019-11-07 04:43:29,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:29,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-11-07 04:43:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:29,297 INFO L225 Difference]: With dead ends: 340 [2019-11-07 04:43:29,297 INFO L226 Difference]: Without dead ends: 184 [2019-11-07 04:43:29,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-07 04:43:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2019-11-07 04:43:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-07 04:43:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 252 transitions. [2019-11-07 04:43:29,317 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 252 transitions. Word has length 36 [2019-11-07 04:43:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:29,317 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 252 transitions. [2019-11-07 04:43:29,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:43:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2019-11-07 04:43:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 04:43:29,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:29,320 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] [2019-11-07 04:43:29,320 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:29,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:29,321 INFO L82 PathProgramCache]: Analyzing trace with hash 985709149, now seen corresponding path program 1 times [2019-11-07 04:43:29,321 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:29,321 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198010823] [2019-11-07 04:43:29,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:29,438 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 04:43:29,438 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198010823] [2019-11-07 04:43:29,439 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:29,439 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:43:29,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080305381] [2019-11-07 04:43:29,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:43:29,440 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:29,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:43:29,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:43:29,441 INFO L87 Difference]: Start difference. First operand 180 states and 252 transitions. Second operand 4 states. [2019-11-07 04:43:29,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:29,471 INFO L93 Difference]: Finished difference Result 303 states and 425 transitions. [2019-11-07 04:43:29,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:43:29,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-07 04:43:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:29,475 INFO L225 Difference]: With dead ends: 303 [2019-11-07 04:43:29,475 INFO L226 Difference]: Without dead ends: 176 [2019-11-07 04:43:29,477 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 04:43:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-07 04:43:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-11-07 04:43:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-07 04:43:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 244 transitions. [2019-11-07 04:43:29,496 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 244 transitions. Word has length 37 [2019-11-07 04:43:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:29,496 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 244 transitions. [2019-11-07 04:43:29,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:43:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 244 transitions. [2019-11-07 04:43:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 04:43:29,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:29,503 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] [2019-11-07 04:43:29,503 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:29,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash -562127975, now seen corresponding path program 1 times [2019-11-07 04:43:29,505 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:29,505 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719291113] [2019-11-07 04:43:29,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:43:29,622 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719291113] [2019-11-07 04:43:29,622 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:29,622 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:43:29,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990842954] [2019-11-07 04:43:29,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:43:29,623 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:29,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:43:29,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:43:29,624 INFO L87 Difference]: Start difference. First operand 176 states and 244 transitions. Second operand 4 states. [2019-11-07 04:43:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:29,687 INFO L93 Difference]: Finished difference Result 348 states and 492 transitions. [2019-11-07 04:43:29,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:29,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-07 04:43:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:29,690 INFO L225 Difference]: With dead ends: 348 [2019-11-07 04:43:29,690 INFO L226 Difference]: Without dead ends: 193 [2019-11-07 04:43:29,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-07 04:43:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2019-11-07 04:43:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-07 04:43:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 262 transitions. [2019-11-07 04:43:29,702 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 262 transitions. Word has length 38 [2019-11-07 04:43:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:29,703 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 262 transitions. [2019-11-07 04:43:29,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:43:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2019-11-07 04:43:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 04:43:29,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:29,704 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] [2019-11-07 04:43:29,704 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:29,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2048456470, now seen corresponding path program 1 times [2019-11-07 04:43:29,705 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:29,705 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512541105] [2019-11-07 04:43:29,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:29,750 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 04:43:29,750 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512541105] [2019-11-07 04:43:29,750 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:29,750 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:43:29,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121327317] [2019-11-07 04:43:29,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:43:29,751 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:29,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:43:29,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:43:29,752 INFO L87 Difference]: Start difference. First operand 191 states and 262 transitions. Second operand 4 states. [2019-11-07 04:43:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:29,836 INFO L93 Difference]: Finished difference Result 366 states and 516 transitions. [2019-11-07 04:43:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:29,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-07 04:43:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:29,839 INFO L225 Difference]: With dead ends: 366 [2019-11-07 04:43:29,839 INFO L226 Difference]: Without dead ends: 198 [2019-11-07 04:43:29,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-07 04:43:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-11-07 04:43:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-07 04:43:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 266 transitions. [2019-11-07 04:43:29,861 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 266 transitions. Word has length 38 [2019-11-07 04:43:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:29,862 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 266 transitions. [2019-11-07 04:43:29,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:43:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 266 transitions. [2019-11-07 04:43:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:43:29,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:29,865 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-07 04:43:29,865 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash -905435297, now seen corresponding path program 1 times [2019-11-07 04:43:29,865 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:29,866 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45618052] [2019-11-07 04:43:29,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-07 04:43:29,955 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45618052] [2019-11-07 04:43:29,955 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:29,955 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:43:29,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896454994] [2019-11-07 04:43:29,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:43:29,956 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:43:29,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:29,957 INFO L87 Difference]: Start difference. First operand 196 states and 266 transitions. Second operand 5 states. [2019-11-07 04:43:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:29,984 INFO L93 Difference]: Finished difference Result 364 states and 500 transitions. [2019-11-07 04:43:29,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:29,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-11-07 04:43:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:29,987 INFO L225 Difference]: With dead ends: 364 [2019-11-07 04:43:29,988 INFO L226 Difference]: Without dead ends: 198 [2019-11-07 04:43:29,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-07 04:43:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-11-07 04:43:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-07 04:43:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2019-11-07 04:43:30,006 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 55 [2019-11-07 04:43:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:30,007 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2019-11-07 04:43:30,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:43:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2019-11-07 04:43:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:43:30,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:30,008 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-07 04:43:30,009 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:30,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1171722150, now seen corresponding path program 1 times [2019-11-07 04:43:30,009 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:30,010 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505497132] [2019-11-07 04:43:30,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-07 04:43:30,081 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505497132] [2019-11-07 04:43:30,081 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:30,081 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:43:30,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944576777] [2019-11-07 04:43:30,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:43:30,082 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:30,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:43:30,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:43:30,084 INFO L87 Difference]: Start difference. First operand 196 states and 265 transitions. Second operand 4 states. [2019-11-07 04:43:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:30,141 INFO L93 Difference]: Finished difference Result 376 states and 520 transitions. [2019-11-07 04:43:30,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:30,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-07 04:43:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:30,146 INFO L225 Difference]: With dead ends: 376 [2019-11-07 04:43:30,146 INFO L226 Difference]: Without dead ends: 215 [2019-11-07 04:43:30,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:30,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-07 04:43:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-11-07 04:43:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-07 04:43:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 285 transitions. [2019-11-07 04:43:30,163 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 285 transitions. Word has length 57 [2019-11-07 04:43:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:30,166 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 285 transitions. [2019-11-07 04:43:30,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:43:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 285 transitions. [2019-11-07 04:43:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:43:30,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:30,167 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-07 04:43:30,168 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:30,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:30,168 INFO L82 PathProgramCache]: Analyzing trace with hash -812439080, now seen corresponding path program 1 times [2019-11-07 04:43:30,172 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:30,173 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559267399] [2019-11-07 04:43:30,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-07 04:43:30,233 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559267399] [2019-11-07 04:43:30,233 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:30,234 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:43:30,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211392436] [2019-11-07 04:43:30,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:43:30,234 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:30,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:43:30,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:43:30,236 INFO L87 Difference]: Start difference. First operand 213 states and 285 transitions. Second operand 4 states. [2019-11-07 04:43:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:30,295 INFO L93 Difference]: Finished difference Result 387 states and 532 transitions. [2019-11-07 04:43:30,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:43:30,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-07 04:43:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:30,299 INFO L225 Difference]: With dead ends: 387 [2019-11-07 04:43:30,299 INFO L226 Difference]: Without dead ends: 211 [2019-11-07 04:43:30,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-07 04:43:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-11-07 04:43:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-07 04:43:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 279 transitions. [2019-11-07 04:43:30,315 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 279 transitions. Word has length 58 [2019-11-07 04:43:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:30,315 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 279 transitions. [2019-11-07 04:43:30,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:43:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 279 transitions. [2019-11-07 04:43:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-07 04:43:30,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:30,316 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-11-07 04:43:30,317 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1928367096, now seen corresponding path program 1 times [2019-11-07 04:43:30,317 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:30,318 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493317942] [2019-11-07 04:43:30,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-07 04:43:30,430 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493317942] [2019-11-07 04:43:30,430 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:30,430 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:43:30,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7677303] [2019-11-07 04:43:30,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:43:30,432 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:30,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:43:30,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:30,432 INFO L87 Difference]: Start difference. First operand 211 states and 279 transitions. Second operand 5 states. [2019-11-07 04:43:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:30,459 INFO L93 Difference]: Finished difference Result 379 states and 508 transitions. [2019-11-07 04:43:30,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:30,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-11-07 04:43:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:30,462 INFO L225 Difference]: With dead ends: 379 [2019-11-07 04:43:30,462 INFO L226 Difference]: Without dead ends: 213 [2019-11-07 04:43:30,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-07 04:43:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-11-07 04:43:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-07 04:43:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2019-11-07 04:43:30,475 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 76 [2019-11-07 04:43:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:30,475 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2019-11-07 04:43:30,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:43:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2019-11-07 04:43:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-07 04:43:30,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:30,477 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-07 04:43:30,477 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:30,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1106817535, now seen corresponding path program 1 times [2019-11-07 04:43:30,477 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:30,478 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602877072] [2019-11-07 04:43:30,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-07 04:43:30,578 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602877072] [2019-11-07 04:43:30,578 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:30,578 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:43:30,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784981160] [2019-11-07 04:43:30,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:43:30,579 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:30,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:43:30,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:43:30,580 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 4 states. [2019-11-07 04:43:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:30,639 INFO L93 Difference]: Finished difference Result 368 states and 506 transitions. [2019-11-07 04:43:30,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:43:30,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-07 04:43:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:30,642 INFO L225 Difference]: With dead ends: 368 [2019-11-07 04:43:30,642 INFO L226 Difference]: Without dead ends: 209 [2019-11-07 04:43:30,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-07 04:43:30,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-11-07 04:43:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-07 04:43:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 274 transitions. [2019-11-07 04:43:30,656 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 274 transitions. Word has length 78 [2019-11-07 04:43:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:30,657 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 274 transitions. [2019-11-07 04:43:30,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:43:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2019-11-07 04:43:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-07 04:43:30,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:30,664 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-07 04:43:30,664 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:30,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1814640674, now seen corresponding path program 1 times [2019-11-07 04:43:30,665 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:30,665 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719182688] [2019-11-07 04:43:30,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-07 04:43:30,755 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719182688] [2019-11-07 04:43:30,755 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373575382] [2019-11-07 04:43:30,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:43:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:30,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 04:43:30,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:43:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-07 04:43:30,991 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:43:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-07 04:43:31,094 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [942284800] [2019-11-07 04:43:31,140 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2019-11-07 04:43:31,140 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:43:31,157 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:43:31,165 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:43:31,165 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:43:31,568 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 169 for LOIs [2019-11-07 04:43:32,416 INFO L197 IcfgInterpreter]: Interpreting procedure gate1_each_pals_period with input of size 119 for LOIs [2019-11-07 04:43:32,428 INFO L197 IcfgInterpreter]: Interpreting procedure write_history_bool with input of size 119 for LOIs [2019-11-07 04:43:32,435 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 91 for LOIs [2019-11-07 04:43:32,438 INFO L197 IcfgInterpreter]: Interpreting procedure init with input of size 89 for LOIs [2019-11-07 04:43:33,103 INFO L197 IcfgInterpreter]: Interpreting procedure add_history_type with input of size 113 for LOIs [2019-11-07 04:43:33,577 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-11-07 04:43:33,819 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-11-07 04:43:34,043 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-11-07 04:43:34,250 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-11-07 04:43:34,453 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-11-07 04:43:34,664 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-11-07 04:43:35,378 INFO L197 IcfgInterpreter]: Interpreting procedure read_history_bool with input of size 10 for LOIs [2019-11-07 04:43:35,431 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:43:35,561 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-07 04:43:35,721 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-07 04:43:36,372 WARN L191 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 102 [2019-11-07 04:43:37,107 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 141 [2019-11-07 04:43:37,755 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 133 [2019-11-07 04:43:38,016 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-11-07 04:43:38,705 WARN L191 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-11-07 04:43:39,438 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-11-07 04:43:39,767 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-11-07 04:43:40,566 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-11-07 04:43:40,952 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 88 [2019-11-07 04:43:41,886 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2019-11-07 04:43:42,341 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2019-11-07 04:43:43,069 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 92 [2019-11-07 04:43:43,638 WARN L191 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 95 [2019-11-07 04:43:44,687 WARN L191 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 139 [2019-11-07 04:43:45,660 WARN L191 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 139 [2019-11-07 04:43:46,252 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2019-11-07 04:43:46,654 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-11-07 04:43:47,090 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 113 [2019-11-07 04:43:47,571 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 117 [2019-11-07 04:43:47,572 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 04:43:47,572 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [4, 4, 4] total 43 [2019-11-07 04:43:47,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30638317] [2019-11-07 04:43:47,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-07 04:43:47,574 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-07 04:43:47,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1657, Unknown=0, NotChecked=0, Total=1806 [2019-11-07 04:43:47,576 INFO L87 Difference]: Start difference. First operand 209 states and 274 transitions. Second operand 39 states. [2019-11-07 04:43:48,505 WARN L191 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 145 [2019-11-07 04:43:48,885 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-11-07 04:43:49,810 WARN L191 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 164 [2019-11-07 04:43:50,738 WARN L191 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 166 [2019-11-07 04:43:51,686 WARN L191 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 168 [2019-11-07 04:43:52,037 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-11-07 04:43:52,391 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2019-11-07 04:43:53,569 WARN L191 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 178 [2019-11-07 04:43:54,574 WARN L191 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 171 [2019-11-07 04:43:55,558 WARN L191 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 171 [2019-11-07 04:43:56,560 WARN L191 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 174 [2019-11-07 04:43:56,995 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-11-07 04:43:57,342 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-11-07 04:43:58,408 WARN L191 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 168 [2019-11-07 04:43:58,822 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-11-07 04:44:00,072 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 213 DAG size of output: 209 [2019-11-07 04:44:01,237 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 212 DAG size of output: 208 [2019-11-07 04:44:02,359 WARN L191 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 211 [2019-11-07 04:44:02,810 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-07 04:44:03,226 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-11-07 04:44:04,281 WARN L191 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 169 [2019-11-07 04:44:05,228 WARN L191 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 168 [2019-11-07 04:44:05,668 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-11-07 04:44:06,737 WARN L191 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 180