/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-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:42:46,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:42:46,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:42:46,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:42:46,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:42:46,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:42:46,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:42:46,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:42:46,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:42:46,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:42:46,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:42:46,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:42:46,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:42:46,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:42:46,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:42:46,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:42:46,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:42:46,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:42:46,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:42:46,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:42:46,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:42:46,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:42:46,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:42:46,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:42:46,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:42:46,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:42:46,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:42:46,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:42:46,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:42:46,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:42:46,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:42:46,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:42:46,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:42:46,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:42:46,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:42:46,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:42:46,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:42:46,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:42:46,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:42:46,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:42:46,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:42:46,676 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:42:46,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:42:46,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:42:46,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:42:46,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:42:46,719 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:42:46,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:42:46,720 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:42:46,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:42:46,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:42:46,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:42:46,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:42:46,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:42:46,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:42:46,724 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:42:46,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:42:46,725 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:42:46,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:42:46,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:42:46,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:42:46,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:42:46,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:42:46,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:42:46,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:42:46,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:42:46,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:42:46,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:42:46,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:42:46,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:42:46,728 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:42:47,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:42:47,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:42:47,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:42:47,043 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:42:47,043 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:42:47,044 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 04:42:47,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00df485a6/f2c6f2360da449b091dc7b1f7687a218/FLAG3aea80d83 [2019-11-07 04:42:47,732 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:42:47,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 04:42:47,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00df485a6/f2c6f2360da449b091dc7b1f7687a218/FLAG3aea80d83 [2019-11-07 04:42:48,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00df485a6/f2c6f2360da449b091dc7b1f7687a218 [2019-11-07 04:42:48,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:42:48,015 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:42:48,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:42:48,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:42:48,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:42:48,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:48" (1/1) ... [2019-11-07 04:42:48,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c5888d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48, skipping insertion in model container [2019-11-07 04:42:48,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:48" (1/1) ... [2019-11-07 04:42:48,032 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:42:48,098 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:42:48,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:42:48,767 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:42:48,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:42:49,017 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:42:49,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:49 WrapperNode [2019-11-07 04:42:49,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:42:49,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:42:49,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:42:49,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:42:49,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:49" (1/1) ... [2019-11-07 04:42:49,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:49" (1/1) ... [2019-11-07 04:42:49,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:49" (1/1) ... [2019-11-07 04:42:49,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:49" (1/1) ... [2019-11-07 04:42:49,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:49" (1/1) ... [2019-11-07 04:42:49,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:49" (1/1) ... [2019-11-07 04:42:49,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:49" (1/1) ... [2019-11-07 04:42:49,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:42:49,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:42:49,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:42:49,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:42:49,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:42:49,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:42:49,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:42:49,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:42:49,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:42:49,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:42:49,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 04:42:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:42:49,252 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:42:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:42:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:42:49,253 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:42:49,254 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:42:49,254 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:42:49,254 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:42:49,255 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:42:49,255 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:42:49,257 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:42:49,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:42:49,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:42:52,185 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:42:52,186 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:42:52,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:52 BoogieIcfgContainer [2019-11-07 04:42:52,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:42:52,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:42:52,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:42:52,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:42:52,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:42:48" (1/3) ... [2019-11-07 04:42:52,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7120912d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:52, skipping insertion in model container [2019-11-07 04:42:52,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:49" (2/3) ... [2019-11-07 04:42:52,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7120912d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:52, skipping insertion in model container [2019-11-07 04:42:52,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:52" (3/3) ... [2019-11-07 04:42:52,196 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 04:42:52,207 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:42:52,216 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 04:42:52,227 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 04:42:52,257 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:42:52,258 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:42:52,258 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:42:52,258 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:42:52,258 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:42:52,258 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:42:52,258 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:42:52,258 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:42:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states. [2019-11-07 04:42:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-07 04:42:52,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:52,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:52,309 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:52,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:52,315 INFO L82 PathProgramCache]: Analyzing trace with hash -88145364, now seen corresponding path program 1 times [2019-11-07 04:42:52,325 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:52,326 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84974966] [2019-11-07 04:42:52,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:53,538 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:42:53,539 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84974966] [2019-11-07 04:42:53,540 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:53,540 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:53,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270601142] [2019-11-07 04:42:53,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:53,548 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:53,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:53,566 INFO L87 Difference]: Start difference. First operand 320 states. Second operand 6 states. [2019-11-07 04:42:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:53,906 INFO L93 Difference]: Finished difference Result 834 states and 1461 transitions. [2019-11-07 04:42:53,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:53,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-11-07 04:42:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:53,932 INFO L225 Difference]: With dead ends: 834 [2019-11-07 04:42:53,932 INFO L226 Difference]: Without dead ends: 567 [2019-11-07 04:42:53,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-11-07 04:42:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 545. [2019-11-07 04:42:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-11-07 04:42:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 723 transitions. [2019-11-07 04:42:54,036 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 723 transitions. Word has length 123 [2019-11-07 04:42:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:54,037 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 723 transitions. [2019-11-07 04:42:54,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 723 transitions. [2019-11-07 04:42:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-07 04:42:54,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:54,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:54,049 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:54,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1796124794, now seen corresponding path program 1 times [2019-11-07 04:42:54,050 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:54,050 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632590203] [2019-11-07 04:42:54,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:54,196 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:42:54,197 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632590203] [2019-11-07 04:42:54,197 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:54,198 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:54,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51176051] [2019-11-07 04:42:54,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:54,201 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:54,202 INFO L87 Difference]: Start difference. First operand 545 states and 723 transitions. Second operand 3 states. [2019-11-07 04:42:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:54,302 INFO L93 Difference]: Finished difference Result 1238 states and 1691 transitions. [2019-11-07 04:42:54,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:54,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-07 04:42:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:54,307 INFO L225 Difference]: With dead ends: 1238 [2019-11-07 04:42:54,307 INFO L226 Difference]: Without dead ends: 737 [2019-11-07 04:42:54,311 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:42:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-11-07 04:42:54,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 652. [2019-11-07 04:42:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-11-07 04:42:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 896 transitions. [2019-11-07 04:42:54,351 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 896 transitions. Word has length 125 [2019-11-07 04:42:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:54,352 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 896 transitions. [2019-11-07 04:42:54,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 896 transitions. [2019-11-07 04:42:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-07 04:42:54,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:54,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:54,359 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:54,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:54,360 INFO L82 PathProgramCache]: Analyzing trace with hash -254745606, now seen corresponding path program 1 times [2019-11-07 04:42:54,361 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:54,361 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77339211] [2019-11-07 04:42:54,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:54,500 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:42:54,501 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77339211] [2019-11-07 04:42:54,501 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:54,501 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:54,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353994064] [2019-11-07 04:42:54,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:54,507 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:54,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:54,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:54,508 INFO L87 Difference]: Start difference. First operand 652 states and 896 transitions. Second operand 3 states. [2019-11-07 04:42:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:54,681 INFO L93 Difference]: Finished difference Result 1509 states and 2134 transitions. [2019-11-07 04:42:54,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:54,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-07 04:42:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:54,689 INFO L225 Difference]: With dead ends: 1509 [2019-11-07 04:42:54,694 INFO L226 Difference]: Without dead ends: 925 [2019-11-07 04:42:54,696 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:42:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-11-07 04:42:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 853. [2019-11-07 04:42:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-11-07 04:42:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1221 transitions. [2019-11-07 04:42:54,747 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1221 transitions. Word has length 125 [2019-11-07 04:42:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:54,748 INFO L462 AbstractCegarLoop]: Abstraction has 853 states and 1221 transitions. [2019-11-07 04:42:54,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1221 transitions. [2019-11-07 04:42:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-07 04:42:54,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:54,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:54,752 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:54,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1233192348, now seen corresponding path program 1 times [2019-11-07 04:42:54,753 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:54,753 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914860014] [2019-11-07 04:42:54,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:54,880 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:42:54,881 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914860014] [2019-11-07 04:42:54,881 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:54,881 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:54,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761766511] [2019-11-07 04:42:54,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:54,883 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:54,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:54,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:54,884 INFO L87 Difference]: Start difference. First operand 853 states and 1221 transitions. Second operand 6 states. [2019-11-07 04:42:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:55,359 INFO L93 Difference]: Finished difference Result 2178 states and 3205 transitions. [2019-11-07 04:42:55,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:55,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-11-07 04:42:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:55,368 INFO L225 Difference]: With dead ends: 2178 [2019-11-07 04:42:55,368 INFO L226 Difference]: Without dead ends: 1367 [2019-11-07 04:42:55,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:42:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-11-07 04:42:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1275. [2019-11-07 04:42:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-11-07 04:42:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1897 transitions. [2019-11-07 04:42:55,516 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1897 transitions. Word has length 128 [2019-11-07 04:42:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:55,517 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1897 transitions. [2019-11-07 04:42:55,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1897 transitions. [2019-11-07 04:42:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-07 04:42:55,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:55,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:55,519 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:55,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1281543543, now seen corresponding path program 1 times [2019-11-07 04:42:55,520 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:55,520 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234890718] [2019-11-07 04:42:55,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:55,669 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:42:55,670 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234890718] [2019-11-07 04:42:55,670 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:55,670 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:55,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466930237] [2019-11-07 04:42:55,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:55,671 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:55,672 INFO L87 Difference]: Start difference. First operand 1275 states and 1897 transitions. Second operand 3 states. [2019-11-07 04:42:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:55,822 INFO L93 Difference]: Finished difference Result 2434 states and 3639 transitions. [2019-11-07 04:42:55,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:55,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-11-07 04:42:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:55,836 INFO L225 Difference]: With dead ends: 2434 [2019-11-07 04:42:55,837 INFO L226 Difference]: Without dead ends: 1876 [2019-11-07 04:42:55,839 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:42:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2019-11-07 04:42:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1854. [2019-11-07 04:42:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-11-07 04:42:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2754 transitions. [2019-11-07 04:42:55,947 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2754 transitions. Word has length 128 [2019-11-07 04:42:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:55,947 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 2754 transitions. [2019-11-07 04:42:55,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2754 transitions. [2019-11-07 04:42:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-07 04:42:55,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:55,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:55,950 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:55,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash -333562049, now seen corresponding path program 1 times [2019-11-07 04:42:55,951 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:55,951 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114438170] [2019-11-07 04:42:55,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:56,407 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:42:56,407 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114438170] [2019-11-07 04:42:56,409 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:56,409 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:56,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582393397] [2019-11-07 04:42:56,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:56,410 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:56,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:56,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:56,411 INFO L87 Difference]: Start difference. First operand 1854 states and 2754 transitions. Second operand 5 states. [2019-11-07 04:42:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:56,700 INFO L93 Difference]: Finished difference Result 5295 states and 7912 transitions. [2019-11-07 04:42:56,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:56,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-11-07 04:42:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:56,719 INFO L225 Difference]: With dead ends: 5295 [2019-11-07 04:42:56,719 INFO L226 Difference]: Without dead ends: 3548 [2019-11-07 04:42:56,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2019-11-07 04:42:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3526. [2019-11-07 04:42:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2019-11-07 04:42:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5217 transitions. [2019-11-07 04:42:56,934 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5217 transitions. Word has length 128 [2019-11-07 04:42:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:56,934 INFO L462 AbstractCegarLoop]: Abstraction has 3526 states and 5217 transitions. [2019-11-07 04:42:56,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5217 transitions. [2019-11-07 04:42:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-07 04:42:56,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:56,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:56,938 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:56,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1525850627, now seen corresponding path program 1 times [2019-11-07 04:42:56,939 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:56,939 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986778900] [2019-11-07 04:42:56,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:57,070 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:42:57,070 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986778900] [2019-11-07 04:42:57,071 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:57,071 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:57,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515193816] [2019-11-07 04:42:57,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:57,072 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:57,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:57,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:57,072 INFO L87 Difference]: Start difference. First operand 3526 states and 5217 transitions. Second operand 3 states. [2019-11-07 04:42:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:57,447 INFO L93 Difference]: Finished difference Result 9122 states and 13744 transitions. [2019-11-07 04:42:57,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:57,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-07 04:42:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:57,476 INFO L225 Difference]: With dead ends: 9122 [2019-11-07 04:42:57,477 INFO L226 Difference]: Without dead ends: 5742 [2019-11-07 04:42:57,485 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:42:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2019-11-07 04:42:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5558. [2019-11-07 04:42:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-11-07 04:42:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8399 transitions. [2019-11-07 04:42:57,962 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8399 transitions. Word has length 130 [2019-11-07 04:42:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:57,962 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 8399 transitions. [2019-11-07 04:42:57,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8399 transitions. [2019-11-07 04:42:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-07 04:42:57,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:57,966 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:57,966 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2057522103, now seen corresponding path program 1 times [2019-11-07 04:42:57,967 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:57,967 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003562434] [2019-11-07 04:42:57,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:58,107 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:42:58,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003562434] [2019-11-07 04:42:58,108 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:58,108 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:58,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248923863] [2019-11-07 04:42:58,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:58,109 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:58,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:58,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:58,109 INFO L87 Difference]: Start difference. First operand 5558 states and 8399 transitions. Second operand 5 states. [2019-11-07 04:42:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:58,724 INFO L93 Difference]: Finished difference Result 10982 states and 16629 transitions. [2019-11-07 04:42:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:58,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-11-07 04:42:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:58,752 INFO L225 Difference]: With dead ends: 10982 [2019-11-07 04:42:58,752 INFO L226 Difference]: Without dead ends: 5558 [2019-11-07 04:42:58,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:42:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2019-11-07 04:42:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 5558. [2019-11-07 04:42:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-11-07 04:42:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8279 transitions. [2019-11-07 04:42:59,110 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8279 transitions. Word has length 133 [2019-11-07 04:42:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:59,111 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 8279 transitions. [2019-11-07 04:42:59,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8279 transitions. [2019-11-07 04:42:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-07 04:42:59,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:59,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:59,115 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:59,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash 100294532, now seen corresponding path program 1 times [2019-11-07 04:42:59,116 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:59,116 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247613769] [2019-11-07 04:42:59,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:59,527 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:42:59,528 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247613769] [2019-11-07 04:42:59,529 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:59,529 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:59,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704010815] [2019-11-07 04:42:59,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:59,530 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:59,531 INFO L87 Difference]: Start difference. First operand 5558 states and 8279 transitions. Second operand 5 states. [2019-11-07 04:42:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:59,913 INFO L93 Difference]: Finished difference Result 6461 states and 9604 transitions. [2019-11-07 04:42:59,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:59,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-11-07 04:42:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:59,936 INFO L225 Difference]: With dead ends: 6461 [2019-11-07 04:42:59,936 INFO L226 Difference]: Without dead ends: 4735 [2019-11-07 04:42:59,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2019-11-07 04:43:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 4696. [2019-11-07 04:43:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4696 states. [2019-11-07 04:43:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 7003 transitions. [2019-11-07 04:43:00,180 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 7003 transitions. Word has length 133 [2019-11-07 04:43:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:00,180 INFO L462 AbstractCegarLoop]: Abstraction has 4696 states and 7003 transitions. [2019-11-07 04:43:00,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:43:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 7003 transitions. [2019-11-07 04:43:00,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-07 04:43:00,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:00,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:43:00,184 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:00,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1643558573, now seen corresponding path program 1 times [2019-11-07 04:43:00,185 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:00,185 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111057308] [2019-11-07 04:43:00,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:00,462 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:00,462 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111057308] [2019-11-07 04:43:00,463 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:00,463 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:43:00,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089486593] [2019-11-07 04:43:00,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:43:00,464 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:00,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:43:00,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:00,465 INFO L87 Difference]: Start difference. First operand 4696 states and 7003 transitions. Second operand 5 states. [2019-11-07 04:43:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:00,982 INFO L93 Difference]: Finished difference Result 13582 states and 20369 transitions. [2019-11-07 04:43:00,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:00,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-11-07 04:43:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:01,004 INFO L225 Difference]: With dead ends: 13582 [2019-11-07 04:43:01,005 INFO L226 Difference]: Without dead ends: 9053 [2019-11-07 04:43:01,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9053 states. [2019-11-07 04:43:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9053 to 9031. [2019-11-07 04:43:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9031 states. [2019-11-07 04:43:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 13457 transitions. [2019-11-07 04:43:01,568 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 13457 transitions. Word has length 133 [2019-11-07 04:43:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:01,568 INFO L462 AbstractCegarLoop]: Abstraction has 9031 states and 13457 transitions. [2019-11-07 04:43:01,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:43:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 13457 transitions. [2019-11-07 04:43:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-07 04:43:01,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:01,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:43:01,573 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash -640634061, now seen corresponding path program 1 times [2019-11-07 04:43:01,574 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:01,574 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543807566] [2019-11-07 04:43:01,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:01,680 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:01,680 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543807566] [2019-11-07 04:43:01,680 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:01,681 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:43:01,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793647873] [2019-11-07 04:43:01,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:43:01,682 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:01,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:43:01,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:43:01,682 INFO L87 Difference]: Start difference. First operand 9031 states and 13457 transitions. Second operand 3 states. [2019-11-07 04:43:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:02,485 INFO L93 Difference]: Finished difference Result 16931 states and 25211 transitions. [2019-11-07 04:43:02,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:43:02,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-07 04:43:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:02,513 INFO L225 Difference]: With dead ends: 16931 [2019-11-07 04:43:02,513 INFO L226 Difference]: Without dead ends: 12631 [2019-11-07 04:43:02,523 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:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12631 states. [2019-11-07 04:43:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12631 to 12609. [2019-11-07 04:43:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12609 states. [2019-11-07 04:43:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12609 states to 12609 states and 18567 transitions. [2019-11-07 04:43:03,115 INFO L78 Accepts]: Start accepts. Automaton has 12609 states and 18567 transitions. Word has length 138 [2019-11-07 04:43:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:03,116 INFO L462 AbstractCegarLoop]: Abstraction has 12609 states and 18567 transitions. [2019-11-07 04:43:03,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:43:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 12609 states and 18567 transitions. [2019-11-07 04:43:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-07 04:43:03,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:03,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:43:03,123 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:03,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1935605800, now seen corresponding path program 1 times [2019-11-07 04:43:03,124 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:03,124 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217422125] [2019-11-07 04:43:03,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:03,458 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:03,459 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217422125] [2019-11-07 04:43:03,459 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:03,459 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:43:03,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158402126] [2019-11-07 04:43:03,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:43:03,460 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:03,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:43:03,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:03,460 INFO L87 Difference]: Start difference. First operand 12609 states and 18567 transitions. Second operand 5 states. [2019-11-07 04:43:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:04,235 INFO L93 Difference]: Finished difference Result 20979 states and 31100 transitions. [2019-11-07 04:43:04,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:04,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-11-07 04:43:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:04,269 INFO L225 Difference]: With dead ends: 20979 [2019-11-07 04:43:04,270 INFO L226 Difference]: Without dead ends: 12688 [2019-11-07 04:43:04,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12688 states. [2019-11-07 04:43:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12688 to 12612. [2019-11-07 04:43:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12612 states. [2019-11-07 04:43:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12612 states to 12612 states and 18570 transitions. [2019-11-07 04:43:05,531 INFO L78 Accepts]: Start accepts. Automaton has 12612 states and 18570 transitions. Word has length 138 [2019-11-07 04:43:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:05,531 INFO L462 AbstractCegarLoop]: Abstraction has 12612 states and 18570 transitions. [2019-11-07 04:43:05,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:43:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12612 states and 18570 transitions. [2019-11-07 04:43:05,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-07 04:43:05,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:05,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:43:05,537 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:05,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:05,537 INFO L82 PathProgramCache]: Analyzing trace with hash 407147818, now seen corresponding path program 1 times [2019-11-07 04:43:05,538 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:05,538 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109267199] [2019-11-07 04:43:05,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:06,734 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-11-07 04:43:06,864 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-07 04:43:07,031 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-07 04:43:07,185 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-11-07 04:43:07,339 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-07 04:43:07,531 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-11-07 04:43:07,687 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-11-07 04:43:07,841 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-07 04:43:08,014 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-07 04:43:08,178 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-11-07 04:43:08,373 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-07 04:43:08,528 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-11-07 04:43:08,858 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-11-07 04:43:09,026 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-11-07 04:43:09,415 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-07 04:43:09,728 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-07 04:43:10,360 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-11-07 04:43:10,606 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-11-07 04:43:10,829 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-11-07 04:43:11,689 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:11,690 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109267199] [2019-11-07 04:43:11,690 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:11,690 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2019-11-07 04:43:11,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341070832] [2019-11-07 04:43:11,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-07 04:43:11,691 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-07 04:43:11,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2019-11-07 04:43:11,692 INFO L87 Difference]: Start difference. First operand 12612 states and 18570 transitions. Second operand 34 states. [2019-11-07 04:43:12,363 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 87 [2019-11-07 04:43:12,946 WARN L191 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-11-07 04:43:13,199 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-07 04:43:13,844 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-07 04:43:14,097 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-11-07 04:43:14,308 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-11-07 04:43:14,611 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-11-07 04:43:15,077 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-11-07 04:43:15,541 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-11-07 04:43:16,111 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-11-07 04:43:16,784 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2019-11-07 04:43:17,427 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2019-11-07 04:43:18,143 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 81 [2019-11-07 04:43:19,058 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-11-07 04:43:19,734 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2019-11-07 04:43:20,439 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 83 [2019-11-07 04:43:21,062 WARN L191 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 82 [2019-11-07 04:43:21,841 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82 [2019-11-07 04:43:22,594 WARN L191 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 91 [2019-11-07 04:43:23,336 WARN L191 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 95 [2019-11-07 04:43:24,070 WARN L191 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 100 [2019-11-07 04:43:24,637 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 81 [2019-11-07 04:43:25,176 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80