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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:06,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:06,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:06,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:06,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:06,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:06,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:06,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:06,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:06,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:06,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:06,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:06,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:06,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:06,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:06,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:06,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:06,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:06,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:06,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:06,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:06,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:06,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:06,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:06,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:06,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:06,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:06,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:06,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:06,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:06,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:06,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:06,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:06,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:06,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:06,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:06,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:06,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:06,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:06,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:06,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:06,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:26:06,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:06,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:06,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:06,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:06,703 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:06,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:06,703 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:06,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:06,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:06,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:06,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:06,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:06,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:06,707 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:06,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:06,707 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:06,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:06,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:06,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:06,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:06,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:06,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:06,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:06,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:06,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:06,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:06,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:06,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:06,712 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-10-15 03:26:06,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:07,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:07,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:07,007 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:07,008 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:07,009 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 03:26:07,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a78568123/2a4bcbcb4e5e423f995a7c855f4cd206/FLAG9e4ecccf2 [2019-10-15 03:26:07,713 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:07,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 03:26:07,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a78568123/2a4bcbcb4e5e423f995a7c855f4cd206/FLAG9e4ecccf2 [2019-10-15 03:26:07,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a78568123/2a4bcbcb4e5e423f995a7c855f4cd206 [2019-10-15 03:26:08,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:08,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:08,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:08,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:08,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:08,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:08" (1/1) ... [2019-10-15 03:26:08,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d09c68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:08, skipping insertion in model container [2019-10-15 03:26:08,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:08" (1/1) ... [2019-10-15 03:26:08,028 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:08,117 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:08,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:08,785 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:09,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:09,300 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:09,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:09 WrapperNode [2019-10-15 03:26:09,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:09,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:09,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:09,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:09,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:09" (1/1) ... [2019-10-15 03:26:09,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:09" (1/1) ... [2019-10-15 03:26:09,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:09" (1/1) ... [2019-10-15 03:26:09,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:09" (1/1) ... [2019-10-15 03:26:09,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:09" (1/1) ... [2019-10-15 03:26:09,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:09" (1/1) ... [2019-10-15 03:26:09,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:09" (1/1) ... [2019-10-15 03:26:09,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:09,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:09,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:09,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:09,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:09,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:09,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:09,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:12,207 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:12,207 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:12,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:12 BoogieIcfgContainer [2019-10-15 03:26:12,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:12,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:12,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:12,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:12,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:08" (1/3) ... [2019-10-15 03:26:12,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f2fdf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:12, skipping insertion in model container [2019-10-15 03:26:12,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:09" (2/3) ... [2019-10-15 03:26:12,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f2fdf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:12, skipping insertion in model container [2019-10-15 03:26:12,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:12" (3/3) ... [2019-10-15 03:26:12,217 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 03:26:12,227 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:12,236 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-15 03:26:12,247 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-15 03:26:12,275 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:12,276 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:12,276 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:12,276 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:12,276 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:12,277 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:12,277 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:12,277 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-15 03:26:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 03:26:12,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:12,361 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:12,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:12,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:12,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2122019626, now seen corresponding path program 1 times [2019-10-15 03:26:12,376 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:12,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180943987] [2019-10-15 03:26:12,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:12,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:12,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:13,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180943987] [2019-10-15 03:26:13,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:13,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:26:13,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887612227] [2019-10-15 03:26:13,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:26:13,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:13,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:26:13,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:13,607 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 7 states. [2019-10-15 03:26:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:14,008 INFO L93 Difference]: Finished difference Result 966 states and 1683 transitions. [2019-10-15 03:26:14,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:26:14,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-15 03:26:14,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:14,044 INFO L225 Difference]: With dead ends: 966 [2019-10-15 03:26:14,045 INFO L226 Difference]: Without dead ends: 728 [2019-10-15 03:26:14,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-15 03:26:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 686. [2019-10-15 03:26:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-10-15 03:26:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 895 transitions. [2019-10-15 03:26:14,215 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 895 transitions. Word has length 118 [2019-10-15 03:26:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:14,216 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 895 transitions. [2019-10-15 03:26:14,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:26:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 895 transitions. [2019-10-15 03:26:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 03:26:14,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:14,229 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:14,230 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash -750036124, now seen corresponding path program 1 times [2019-10-15 03:26:14,231 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:14,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319772610] [2019-10-15 03:26:14,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:14,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:14,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:14,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319772610] [2019-10-15 03:26:14,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:14,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:14,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301348608] [2019-10-15 03:26:14,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:14,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:14,460 INFO L87 Difference]: Start difference. First operand 686 states and 895 transitions. Second operand 5 states. [2019-10-15 03:26:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:14,722 INFO L93 Difference]: Finished difference Result 1281 states and 1671 transitions. [2019-10-15 03:26:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:14,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-10-15 03:26:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:14,728 INFO L225 Difference]: With dead ends: 1281 [2019-10-15 03:26:14,729 INFO L226 Difference]: Without dead ends: 686 [2019-10-15 03:26:14,732 INFO L600 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-10-15 03:26:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-10-15 03:26:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2019-10-15 03:26:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-10-15 03:26:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 883 transitions. [2019-10-15 03:26:14,787 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 883 transitions. Word has length 124 [2019-10-15 03:26:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:14,787 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 883 transitions. [2019-10-15 03:26:14,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 883 transitions. [2019-10-15 03:26:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 03:26:14,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:14,792 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:14,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:14,793 INFO L82 PathProgramCache]: Analyzing trace with hash 889076878, now seen corresponding path program 1 times [2019-10-15 03:26:14,793 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:14,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781273588] [2019-10-15 03:26:14,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:14,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:14,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:15,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781273588] [2019-10-15 03:26:15,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:15,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:26:15,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723478431] [2019-10-15 03:26:15,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:26:15,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:15,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:26:15,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:15,479 INFO L87 Difference]: Start difference. First operand 686 states and 883 transitions. Second operand 7 states. [2019-10-15 03:26:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:15,864 INFO L93 Difference]: Finished difference Result 2140 states and 2800 transitions. [2019-10-15 03:26:15,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:26:15,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-10-15 03:26:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:15,872 INFO L225 Difference]: With dead ends: 2140 [2019-10-15 03:26:15,873 INFO L226 Difference]: Without dead ends: 1590 [2019-10-15 03:26:15,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-10-15 03:26:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1548. [2019-10-15 03:26:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-15 03:26:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2040 transitions. [2019-10-15 03:26:15,965 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2040 transitions. Word has length 124 [2019-10-15 03:26:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:15,965 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 2040 transitions. [2019-10-15 03:26:15,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:26:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2040 transitions. [2019-10-15 03:26:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 03:26:15,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:15,970 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:15,971 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:15,971 INFO L82 PathProgramCache]: Analyzing trace with hash -477679404, now seen corresponding path program 1 times [2019-10-15 03:26:15,972 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:15,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087694529] [2019-10-15 03:26:15,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:15,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:15,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:16,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087694529] [2019-10-15 03:26:16,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:16,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:16,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857324382] [2019-10-15 03:26:16,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:16,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:16,108 INFO L87 Difference]: Start difference. First operand 1548 states and 2040 transitions. Second operand 5 states. [2019-10-15 03:26:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:16,457 INFO L93 Difference]: Finished difference Result 3021 states and 3984 transitions. [2019-10-15 03:26:16,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:16,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-10-15 03:26:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:16,468 INFO L225 Difference]: With dead ends: 3021 [2019-10-15 03:26:16,468 INFO L226 Difference]: Without dead ends: 1548 [2019-10-15 03:26:16,473 INFO L600 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-10-15 03:26:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2019-10-15 03:26:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2019-10-15 03:26:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-15 03:26:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2009 transitions. [2019-10-15 03:26:16,612 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2009 transitions. Word has length 124 [2019-10-15 03:26:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:16,613 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 2009 transitions. [2019-10-15 03:26:16,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2009 transitions. [2019-10-15 03:26:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 03:26:16,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:16,619 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:16,620 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:16,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1624067626, now seen corresponding path program 1 times [2019-10-15 03:26:16,621 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:16,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444616660] [2019-10-15 03:26:16,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:16,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:16,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:17,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444616660] [2019-10-15 03:26:17,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:17,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:17,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262313569] [2019-10-15 03:26:17,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:17,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:17,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:17,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:17,068 INFO L87 Difference]: Start difference. First operand 1548 states and 2009 transitions. Second operand 5 states. [2019-10-15 03:26:17,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:17,234 INFO L93 Difference]: Finished difference Result 2533 states and 3343 transitions. [2019-10-15 03:26:17,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:17,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-10-15 03:26:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:17,243 INFO L225 Difference]: With dead ends: 2533 [2019-10-15 03:26:17,244 INFO L226 Difference]: Without dead ends: 1791 [2019-10-15 03:26:17,246 INFO L600 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-10-15 03:26:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-10-15 03:26:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1500. [2019-10-15 03:26:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-10-15 03:26:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1929 transitions. [2019-10-15 03:26:17,365 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1929 transitions. Word has length 124 [2019-10-15 03:26:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:17,366 INFO L462 AbstractCegarLoop]: Abstraction has 1500 states and 1929 transitions. [2019-10-15 03:26:17,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1929 transitions. [2019-10-15 03:26:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 03:26:17,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:17,369 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:17,369 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:17,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:17,369 INFO L82 PathProgramCache]: Analyzing trace with hash -788819286, now seen corresponding path program 1 times [2019-10-15 03:26:17,370 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:17,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523288456] [2019-10-15 03:26:17,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:17,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:17,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:17,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523288456] [2019-10-15 03:26:17,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:17,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:17,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561161603] [2019-10-15 03:26:17,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:17,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:17,837 INFO L87 Difference]: Start difference. First operand 1500 states and 1929 transitions. Second operand 5 states. [2019-10-15 03:26:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:18,078 INFO L93 Difference]: Finished difference Result 2317 states and 2974 transitions. [2019-10-15 03:26:18,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:18,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-15 03:26:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:18,088 INFO L225 Difference]: With dead ends: 2317 [2019-10-15 03:26:18,089 INFO L226 Difference]: Without dead ends: 1765 [2019-10-15 03:26:18,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-10-15 03:26:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1636. [2019-10-15 03:26:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-10-15 03:26:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2077 transitions. [2019-10-15 03:26:18,232 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2077 transitions. Word has length 130 [2019-10-15 03:26:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:18,234 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 2077 transitions. [2019-10-15 03:26:18,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2077 transitions. [2019-10-15 03:26:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 03:26:18,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:18,237 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:18,238 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:18,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1869731908, now seen corresponding path program 1 times [2019-10-15 03:26:18,239 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:18,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582361199] [2019-10-15 03:26:18,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:18,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:18,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:18,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582361199] [2019-10-15 03:26:18,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:18,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:18,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143829879] [2019-10-15 03:26:18,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:18,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:18,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:18,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:18,724 INFO L87 Difference]: Start difference. First operand 1636 states and 2077 transitions. Second operand 5 states. [2019-10-15 03:26:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:18,908 INFO L93 Difference]: Finished difference Result 3154 states and 4087 transitions. [2019-10-15 03:26:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:18,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-15 03:26:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:18,918 INFO L225 Difference]: With dead ends: 3154 [2019-10-15 03:26:18,918 INFO L226 Difference]: Without dead ends: 1889 [2019-10-15 03:26:18,921 INFO L600 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-10-15 03:26:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-10-15 03:26:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1664. [2019-10-15 03:26:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-10-15 03:26:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2109 transitions. [2019-10-15 03:26:19,052 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2109 transitions. Word has length 130 [2019-10-15 03:26:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:19,052 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 2109 transitions. [2019-10-15 03:26:19,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2109 transitions. [2019-10-15 03:26:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 03:26:19,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:19,056 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:19,056 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:19,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:19,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1348043834, now seen corresponding path program 1 times [2019-10-15 03:26:19,057 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:19,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682612607] [2019-10-15 03:26:19,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:19,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:19,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:19,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682612607] [2019-10-15 03:26:19,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:19,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:19,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627084240] [2019-10-15 03:26:19,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:19,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:19,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:19,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:19,600 INFO L87 Difference]: Start difference. First operand 1664 states and 2109 transitions. Second operand 5 states. [2019-10-15 03:26:19,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:19,839 INFO L93 Difference]: Finished difference Result 3144 states and 3975 transitions. [2019-10-15 03:26:19,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:19,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-15 03:26:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:19,850 INFO L225 Difference]: With dead ends: 3144 [2019-10-15 03:26:19,851 INFO L226 Difference]: Without dead ends: 2421 [2019-10-15 03:26:19,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2019-10-15 03:26:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2400. [2019-10-15 03:26:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2400 states. [2019-10-15 03:26:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3022 transitions. [2019-10-15 03:26:20,030 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3022 transitions. Word has length 136 [2019-10-15 03:26:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:20,031 INFO L462 AbstractCegarLoop]: Abstraction has 2400 states and 3022 transitions. [2019-10-15 03:26:20,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:20,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3022 transitions. [2019-10-15 03:26:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 03:26:20,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:20,035 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:20,035 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:20,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:20,036 INFO L82 PathProgramCache]: Analyzing trace with hash -901341700, now seen corresponding path program 1 times [2019-10-15 03:26:20,036 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:20,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694997580] [2019-10-15 03:26:20,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:20,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:20,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:20,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694997580] [2019-10-15 03:26:20,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:20,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:20,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077234640] [2019-10-15 03:26:20,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:20,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:20,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:20,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:20,150 INFO L87 Difference]: Start difference. First operand 2400 states and 3022 transitions. Second operand 5 states. [2019-10-15 03:26:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:20,539 INFO L93 Difference]: Finished difference Result 4758 states and 5997 transitions. [2019-10-15 03:26:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:20,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-15 03:26:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:20,549 INFO L225 Difference]: With dead ends: 4758 [2019-10-15 03:26:20,549 INFO L226 Difference]: Without dead ends: 2400 [2019-10-15 03:26:20,553 INFO L600 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-10-15 03:26:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2019-10-15 03:26:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2400. [2019-10-15 03:26:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2400 states. [2019-10-15 03:26:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 2979 transitions. [2019-10-15 03:26:20,723 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 2979 transitions. Word has length 136 [2019-10-15 03:26:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:20,724 INFO L462 AbstractCegarLoop]: Abstraction has 2400 states and 2979 transitions. [2019-10-15 03:26:20,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2979 transitions. [2019-10-15 03:26:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 03:26:20,728 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:20,728 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:20,728 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:20,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1514093286, now seen corresponding path program 1 times [2019-10-15 03:26:20,729 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:20,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979877529] [2019-10-15 03:26:20,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:20,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:20,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:21,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979877529] [2019-10-15 03:26:21,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:21,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:21,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676030204] [2019-10-15 03:26:21,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:21,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:21,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:21,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:21,096 INFO L87 Difference]: Start difference. First operand 2400 states and 2979 transitions. Second operand 5 states. [2019-10-15 03:26:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:21,429 INFO L93 Difference]: Finished difference Result 3104 states and 3853 transitions. [2019-10-15 03:26:21,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:21,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-15 03:26:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:21,443 INFO L225 Difference]: With dead ends: 3104 [2019-10-15 03:26:21,443 INFO L226 Difference]: Without dead ends: 2417 [2019-10-15 03:26:21,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-10-15 03:26:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2392. [2019-10-15 03:26:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2392 states. [2019-10-15 03:26:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 2969 transitions. [2019-10-15 03:26:21,667 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 2969 transitions. Word has length 136 [2019-10-15 03:26:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:21,668 INFO L462 AbstractCegarLoop]: Abstraction has 2392 states and 2969 transitions. [2019-10-15 03:26:21,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 2969 transitions. [2019-10-15 03:26:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 03:26:21,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:21,675 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:21,676 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash -58368430, now seen corresponding path program 1 times [2019-10-15 03:26:21,676 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:21,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28449658] [2019-10-15 03:26:21,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:21,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:21,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:23,154 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-10-15 03:26:23,371 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-10-15 03:26:23,613 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-10-15 03:26:23,928 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-10-15 03:26:24,119 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-10-15 03:26:24,456 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-10-15 03:26:24,723 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-10-15 03:26:25,006 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-10-15 03:26:25,328 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-10-15 03:26:25,645 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-10-15 03:26:25,888 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-10-15 03:26:26,181 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-10-15 03:26:26,474 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-10-15 03:26:26,804 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-10-15 03:26:27,043 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2019-10-15 03:26:27,410 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-10-15 03:26:27,662 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-10-15 03:26:27,891 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-10-15 03:26:28,312 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-10-15 03:26:28,603 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-10-15 03:26:28,952 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-10-15 03:26:29,230 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-10-15 03:26:29,510 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-10-15 03:26:29,736 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-10-15 03:26:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:30,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28449658] [2019-10-15 03:26:30,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:30,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2019-10-15 03:26:30,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745120104] [2019-10-15 03:26:30,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-15 03:26:30,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:30,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-15 03:26:30,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2019-10-15 03:26:30,598 INFO L87 Difference]: Start difference. First operand 2392 states and 2969 transitions. Second operand 34 states. [2019-10-15 03:26:31,131 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-10-15 03:26:31,760 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-15 03:26:32,097 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-10-15 03:26:32,654 WARN L191 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-10-15 03:26:33,201 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-10-15 03:26:34,015 WARN L191 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-10-15 03:26:34,713 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-10-15 03:26:35,261 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-10-15 03:26:35,920 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2019-10-15 03:26:36,418 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-10-15 03:26:37,001 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-10-15 03:26:37,666 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2019-10-15 03:26:38,230 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 100 [2019-10-15 03:26:38,627 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-10-15 03:26:39,881 WARN L191 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 152 [2019-10-15 03:26:40,846 WARN L191 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2019-10-15 03:26:41,220 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2019-10-15 03:26:42,161 WARN L191 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 140 [2019-10-15 03:26:43,313 WARN L191 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 133 [2019-10-15 03:26:43,912 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2019-10-15 03:26:44,454 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 113