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_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:40,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:40,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:40,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:40,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:40,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:40,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:40,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:40,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:40,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:40,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:40,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:40,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:40,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:40,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:40,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:40,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:40,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:40,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:40,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:40,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:40,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:40,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:40,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:40,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:40,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:40,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:40,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:40,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:40,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:40,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:40,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:40,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:40,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:40,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:40,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:40,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:40,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:40,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:40,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:40,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:40,310 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-13 23:21:40,325 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:40,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:40,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:40,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:40,327 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:40,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:40,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:40,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:40,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:40,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:40,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:40,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:40,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:40,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:40,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:40,329 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:40,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:40,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:40,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:40,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:40,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:40,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:40,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:40,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:40,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:40,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:40,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:40,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:40,332 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-13 23:21:40,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:40,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:40,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:40,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:40,660 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:40,661 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 23:21:40,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee1ed0a69/c9decba1d6c34ac89af7e05555034b53/FLAG928674b8b [2019-10-13 23:21:41,316 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:41,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 23:21:41,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee1ed0a69/c9decba1d6c34ac89af7e05555034b53/FLAG928674b8b [2019-10-13 23:21:41,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee1ed0a69/c9decba1d6c34ac89af7e05555034b53 [2019-10-13 23:21:41,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:41,644 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:41,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:41,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:41,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:41,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:41" (1/1) ... [2019-10-13 23:21:41,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@654cfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:41, skipping insertion in model container [2019-10-13 23:21:41,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:41" (1/1) ... [2019-10-13 23:21:41,659 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:41,713 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:42,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:42,086 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:42,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:42,191 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:42,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:42 WrapperNode [2019-10-13 23:21:42,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:42,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:42,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:42,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:42,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:42" (1/1) ... [2019-10-13 23:21:42,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:42" (1/1) ... [2019-10-13 23:21:42,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:42" (1/1) ... [2019-10-13 23:21:42,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:42" (1/1) ... [2019-10-13 23:21:42,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:42" (1/1) ... [2019-10-13 23:21:42,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:42" (1/1) ... [2019-10-13 23:21:42,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:42" (1/1) ... [2019-10-13 23:21:42,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:42,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:42,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:42,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:42,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:42" (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-13 23:21:42,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:42,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:42,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:21:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:21:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:21:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:21:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:21:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:21:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:21:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:21:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:21:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:21:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:21:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:21:43,709 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:21:43,710 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:21:43,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:43 BoogieIcfgContainer [2019-10-13 23:21:43,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:21:43,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:21:43,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:21:43,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:21:43,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:41" (1/3) ... [2019-10-13 23:21:43,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439b7723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:43, skipping insertion in model container [2019-10-13 23:21:43,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:42" (2/3) ... [2019-10-13 23:21:43,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439b7723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:43, skipping insertion in model container [2019-10-13 23:21:43,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:43" (3/3) ... [2019-10-13 23:21:43,730 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 23:21:43,747 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:21:43,758 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:21:43,772 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:21:43,812 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:21:43,813 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:21:43,813 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:21:43,813 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:21:43,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:21:43,814 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:21:43,814 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:21:43,814 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:21:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-10-13 23:21:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 23:21:43,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:43,862 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] [2019-10-13 23:21:43,864 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash -673173785, now seen corresponding path program 1 times [2019-10-13 23:21:43,880 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:43,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104492182] [2019-10-13 23:21:43,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:43,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:43,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:44,413 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-13 23:21:44,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104492182] [2019-10-13 23:21:44,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:44,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:44,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463700664] [2019-10-13 23:21:44,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:44,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:44,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:44,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:44,440 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 5 states. [2019-10-13 23:21:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:44,710 INFO L93 Difference]: Finished difference Result 309 states and 486 transitions. [2019-10-13 23:21:44,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:44,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-13 23:21:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:44,726 INFO L225 Difference]: With dead ends: 309 [2019-10-13 23:21:44,726 INFO L226 Difference]: Without dead ends: 225 [2019-10-13 23:21:44,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-13 23:21:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2019-10-13 23:21:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-13 23:21:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2019-10-13 23:21:44,828 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 46 [2019-10-13 23:21:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:44,829 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2019-10-13 23:21:44,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2019-10-13 23:21:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:21:44,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:44,834 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] [2019-10-13 23:21:44,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash -182497987, now seen corresponding path program 1 times [2019-10-13 23:21:44,835 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:44,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131987231] [2019-10-13 23:21:44,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:44,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:44,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:45,050 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-13 23:21:45,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131987231] [2019-10-13 23:21:45,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:45,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:21:45,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380869729] [2019-10-13 23:21:45,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:21:45,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:21:45,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:21:45,059 INFO L87 Difference]: Start difference. First operand 221 states and 289 transitions. Second operand 6 states. [2019-10-13 23:21:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:45,284 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2019-10-13 23:21:45,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:45,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-13 23:21:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:45,287 INFO L225 Difference]: With dead ends: 397 [2019-10-13 23:21:45,288 INFO L226 Difference]: Without dead ends: 221 [2019-10-13 23:21:45,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:21:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-13 23:21:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-10-13 23:21:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-13 23:21:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 281 transitions. [2019-10-13 23:21:45,339 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 281 transitions. Word has length 47 [2019-10-13 23:21:45,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:45,339 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 281 transitions. [2019-10-13 23:21:45,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:21:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 281 transitions. [2019-10-13 23:21:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:21:45,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:45,342 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] [2019-10-13 23:21:45,343 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:45,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:45,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1648415540, now seen corresponding path program 1 times [2019-10-13 23:21:45,344 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:45,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963760409] [2019-10-13 23:21:45,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:45,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:45,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:45,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-10-13 23:21:45,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963760409] [2019-10-13 23:21:45,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:45,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:21:45,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763255704] [2019-10-13 23:21:45,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:21:45,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:45,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:21:45,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:21:45,503 INFO L87 Difference]: Start difference. First operand 221 states and 281 transitions. Second operand 6 states. [2019-10-13 23:21:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:45,630 INFO L93 Difference]: Finished difference Result 372 states and 477 transitions. [2019-10-13 23:21:45,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:45,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-13 23:21:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:45,633 INFO L225 Difference]: With dead ends: 372 [2019-10-13 23:21:45,633 INFO L226 Difference]: Without dead ends: 221 [2019-10-13 23:21:45,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:21:45,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-13 23:21:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-10-13 23:21:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-13 23:21:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 271 transitions. [2019-10-13 23:21:45,653 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 271 transitions. Word has length 47 [2019-10-13 23:21:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:45,653 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 271 transitions. [2019-10-13 23:21:45,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:21:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 271 transitions. [2019-10-13 23:21:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:21:45,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:45,656 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] [2019-10-13 23:21:45,656 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:45,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:45,656 INFO L82 PathProgramCache]: Analyzing trace with hash -559064541, now seen corresponding path program 1 times [2019-10-13 23:21:45,657 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:45,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078133318] [2019-10-13 23:21:45,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:45,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:45,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:45,729 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-13 23:21:45,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078133318] [2019-10-13 23:21:45,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:45,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:45,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593052579] [2019-10-13 23:21:45,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:45,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:45,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:45,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:45,732 INFO L87 Difference]: Start difference. First operand 221 states and 271 transitions. Second operand 5 states. [2019-10-13 23:21:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:45,891 INFO L93 Difference]: Finished difference Result 358 states and 448 transitions. [2019-10-13 23:21:45,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:45,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-13 23:21:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:45,893 INFO L225 Difference]: With dead ends: 358 [2019-10-13 23:21:45,893 INFO L226 Difference]: Without dead ends: 221 [2019-10-13 23:21:45,897 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-13 23:21:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-13 23:21:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-10-13 23:21:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-13 23:21:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2019-10-13 23:21:45,914 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 48 [2019-10-13 23:21:45,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:45,915 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2019-10-13 23:21:45,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2019-10-13 23:21:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:21:45,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:45,917 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] [2019-10-13 23:21:45,917 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:45,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash -852097956, now seen corresponding path program 1 times [2019-10-13 23:21:45,918 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:45,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481018727] [2019-10-13 23:21:45,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:45,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:45,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:46,207 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-13 23:21:46,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481018727] [2019-10-13 23:21:46,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:46,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:21:46,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778560170] [2019-10-13 23:21:46,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:21:46,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:46,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:21:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:21:46,211 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand 11 states. [2019-10-13 23:21:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:46,711 INFO L93 Difference]: Finished difference Result 405 states and 502 transitions. [2019-10-13 23:21:46,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:21:46,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-10-13 23:21:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:46,713 INFO L225 Difference]: With dead ends: 405 [2019-10-13 23:21:46,714 INFO L226 Difference]: Without dead ends: 348 [2019-10-13 23:21:46,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:21:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-10-13 23:21:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 281. [2019-10-13 23:21:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-13 23:21:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2019-10-13 23:21:46,738 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 48 [2019-10-13 23:21:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:46,739 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2019-10-13 23:21:46,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:21:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2019-10-13 23:21:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:21:46,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:46,741 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] [2019-10-13 23:21:46,741 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1927649468, now seen corresponding path program 1 times [2019-10-13 23:21:46,742 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:46,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642700926] [2019-10-13 23:21:46,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:46,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:46,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:46,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642700926] [2019-10-13 23:21:46,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:46,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:21:46,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053298581] [2019-10-13 23:21:46,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:21:46,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:46,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:21:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:46,940 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 10 states. [2019-10-13 23:21:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:47,611 INFO L93 Difference]: Finished difference Result 540 states and 663 transitions. [2019-10-13 23:21:47,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:21:47,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-10-13 23:21:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:47,619 INFO L225 Difference]: With dead ends: 540 [2019-10-13 23:21:47,619 INFO L226 Difference]: Without dead ends: 513 [2019-10-13 23:21:47,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:21:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-13 23:21:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 368. [2019-10-13 23:21:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-13 23:21:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 449 transitions. [2019-10-13 23:21:47,655 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 449 transitions. Word has length 48 [2019-10-13 23:21:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:47,655 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 449 transitions. [2019-10-13 23:21:47,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:21:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 449 transitions. [2019-10-13 23:21:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 23:21:47,656 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:47,657 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] [2019-10-13 23:21:47,657 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:47,657 INFO L82 PathProgramCache]: Analyzing trace with hash 162391591, now seen corresponding path program 1 times [2019-10-13 23:21:47,658 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:47,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032135198] [2019-10-13 23:21:47,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:47,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:47,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:47,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-13 23:21:47,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032135198] [2019-10-13 23:21:47,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:47,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:21:47,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301856842] [2019-10-13 23:21:47,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:21:47,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:47,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:21:47,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:47,837 INFO L87 Difference]: Start difference. First operand 368 states and 449 transitions. Second operand 10 states. [2019-10-13 23:21:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:48,850 INFO L93 Difference]: Finished difference Result 960 states and 1235 transitions. [2019-10-13 23:21:48,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:21:48,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-10-13 23:21:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:48,856 INFO L225 Difference]: With dead ends: 960 [2019-10-13 23:21:48,856 INFO L226 Difference]: Without dead ends: 866 [2019-10-13 23:21:48,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-10-13 23:21:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-10-13 23:21:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 635. [2019-10-13 23:21:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 23:21:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 797 transitions. [2019-10-13 23:21:48,914 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 797 transitions. Word has length 49 [2019-10-13 23:21:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:48,914 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 797 transitions. [2019-10-13 23:21:48,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:21:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 797 transitions. [2019-10-13 23:21:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:21:48,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:48,916 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] [2019-10-13 23:21:48,916 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:48,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1780212977, now seen corresponding path program 1 times [2019-10-13 23:21:48,917 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:48,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911855999] [2019-10-13 23:21:48,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:48,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:48,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:49,119 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-13 23:21:49,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911855999] [2019-10-13 23:21:49,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:49,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:21:49,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082689881] [2019-10-13 23:21:49,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:21:49,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:49,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:21:49,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:21:49,121 INFO L87 Difference]: Start difference. First operand 635 states and 797 transitions. Second operand 12 states. [2019-10-13 23:21:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:50,013 INFO L93 Difference]: Finished difference Result 988 states and 1245 transitions. [2019-10-13 23:21:50,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:21:50,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-10-13 23:21:50,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:50,018 INFO L225 Difference]: With dead ends: 988 [2019-10-13 23:21:50,018 INFO L226 Difference]: Without dead ends: 932 [2019-10-13 23:21:50,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-10-13 23:21:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-10-13 23:21:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 635. [2019-10-13 23:21:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 23:21:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 795 transitions. [2019-10-13 23:21:50,086 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 795 transitions. Word has length 50 [2019-10-13 23:21:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:50,087 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 795 transitions. [2019-10-13 23:21:50,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:21:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 795 transitions. [2019-10-13 23:21:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:21:50,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:50,088 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] [2019-10-13 23:21:50,089 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1032655972, now seen corresponding path program 1 times [2019-10-13 23:21:50,089 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:50,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725593217] [2019-10-13 23:21:50,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:50,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:50,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:50,293 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-13 23:21:50,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725593217] [2019-10-13 23:21:50,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:50,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:21:50,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199464196] [2019-10-13 23:21:50,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:21:50,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:21:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:21:50,296 INFO L87 Difference]: Start difference. First operand 635 states and 795 transitions. Second operand 12 states. [2019-10-13 23:21:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:50,928 INFO L93 Difference]: Finished difference Result 1925 states and 2481 transitions. [2019-10-13 23:21:50,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 23:21:50,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-13 23:21:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:50,936 INFO L225 Difference]: With dead ends: 1925 [2019-10-13 23:21:50,936 INFO L226 Difference]: Without dead ends: 1584 [2019-10-13 23:21:50,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-10-13 23:21:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-10-13 23:21:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1054. [2019-10-13 23:21:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-10-13 23:21:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1348 transitions. [2019-10-13 23:21:51,039 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1348 transitions. Word has length 51 [2019-10-13 23:21:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:51,039 INFO L462 AbstractCegarLoop]: Abstraction has 1054 states and 1348 transitions. [2019-10-13 23:21:51,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:21:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1348 transitions. [2019-10-13 23:21:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:21:51,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:51,040 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] [2019-10-13 23:21:51,041 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1747091452, now seen corresponding path program 1 times [2019-10-13 23:21:51,041 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:51,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197563096] [2019-10-13 23:21:51,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:51,279 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-13 23:21:51,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197563096] [2019-10-13 23:21:51,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:51,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:21:51,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172007185] [2019-10-13 23:21:51,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:21:51,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:51,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:21:51,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:21:51,282 INFO L87 Difference]: Start difference. First operand 1054 states and 1348 transitions. Second operand 12 states. [2019-10-13 23:21:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:52,263 INFO L93 Difference]: Finished difference Result 1574 states and 2014 transitions. [2019-10-13 23:21:52,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 23:21:52,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-13 23:21:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:52,275 INFO L225 Difference]: With dead ends: 1574 [2019-10-13 23:21:52,275 INFO L226 Difference]: Without dead ends: 1480 [2019-10-13 23:21:52,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-10-13 23:21:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-10-13 23:21:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1069. [2019-10-13 23:21:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-13 23:21:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1363 transitions. [2019-10-13 23:21:52,438 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1363 transitions. Word has length 51 [2019-10-13 23:21:52,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:52,439 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 1363 transitions. [2019-10-13 23:21:52,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:21:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1363 transitions. [2019-10-13 23:21:52,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 23:21:52,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:52,441 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] [2019-10-13 23:21:52,441 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:52,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:52,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1583938470, now seen corresponding path program 1 times [2019-10-13 23:21:52,442 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:52,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036113090] [2019-10-13 23:21:52,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:52,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:52,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:52,497 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-13 23:21:52,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036113090] [2019-10-13 23:21:52,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:52,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:52,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102071023] [2019-10-13 23:21:52,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:52,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:52,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:52,499 INFO L87 Difference]: Start difference. First operand 1069 states and 1363 transitions. Second operand 3 states. [2019-10-13 23:21:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:52,716 INFO L93 Difference]: Finished difference Result 2403 states and 3130 transitions. [2019-10-13 23:21:52,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:52,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-13 23:21:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:52,724 INFO L225 Difference]: With dead ends: 2403 [2019-10-13 23:21:52,724 INFO L226 Difference]: Without dead ends: 1570 [2019-10-13 23:21:52,727 INFO L600 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-10-13 23:21:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-10-13 23:21:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1566. [2019-10-13 23:21:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-10-13 23:21:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2025 transitions. [2019-10-13 23:21:52,873 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2025 transitions. Word has length 52 [2019-10-13 23:21:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:52,873 INFO L462 AbstractCegarLoop]: Abstraction has 1566 states and 2025 transitions. [2019-10-13 23:21:52,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2025 transitions. [2019-10-13 23:21:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:21:52,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:52,875 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] [2019-10-13 23:21:52,875 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash 62651441, now seen corresponding path program 1 times [2019-10-13 23:21:52,875 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:52,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48306572] [2019-10-13 23:21:52,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:52,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:52,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:54,086 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-10-13 23:21:54,225 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-13 23:21:54,366 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-13 23:21:54,543 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-13 23:21:54,697 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-13 23:21:54,862 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-10-13 23:21:55,032 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-10-13 23:21:55,666 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-13 23:21:55,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48306572] [2019-10-13 23:21:55,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:55,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-10-13 23:21:55,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997188981] [2019-10-13 23:21:55,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 23:21:55,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:55,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 23:21:55,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-10-13 23:21:55,669 INFO L87 Difference]: Start difference. First operand 1566 states and 2025 transitions. Second operand 25 states. [2019-10-13 23:21:55,806 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-10-13 23:21:56,536 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-13 23:21:56,720 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-13 23:21:56,970 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-10-13 23:21:57,386 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-10-13 23:21:57,876 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-10-13 23:21:58,383 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-10-13 23:21:58,967 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2019-10-13 23:21:59,592 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2019-10-13 23:22:00,120 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-10-13 23:22:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:03,167 INFO L93 Difference]: Finished difference Result 3795 states and 4950 transitions. [2019-10-13 23:22:03,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 23:22:03,167 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2019-10-13 23:22:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:03,190 INFO L225 Difference]: With dead ends: 3795 [2019-10-13 23:22:03,190 INFO L226 Difference]: Without dead ends: 3617 [2019-10-13 23:22:03,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=474, Invalid=1166, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 23:22:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2019-10-13 23:22:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 1563. [2019-10-13 23:22:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-10-13 23:22:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2022 transitions. [2019-10-13 23:22:03,458 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2022 transitions. Word has length 53 [2019-10-13 23:22:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:03,459 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 2022 transitions. [2019-10-13 23:22:03,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 23:22:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2022 transitions. [2019-10-13 23:22:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:03,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:03,464 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] [2019-10-13 23:22:03,464 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash -821953624, now seen corresponding path program 1 times [2019-10-13 23:22:03,465 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:03,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034884371] [2019-10-13 23:22:03,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:03,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:03,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:03,511 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-13 23:22:03,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034884371] [2019-10-13 23:22:03,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:03,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:03,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852683804] [2019-10-13 23:22:03,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:03,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:03,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:03,514 INFO L87 Difference]: Start difference. First operand 1563 states and 2022 transitions. Second operand 3 states. [2019-10-13 23:22:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:03,872 INFO L93 Difference]: Finished difference Result 3492 states and 4570 transitions. [2019-10-13 23:22:03,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:03,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-13 23:22:03,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:03,888 INFO L225 Difference]: With dead ends: 3492 [2019-10-13 23:22:03,889 INFO L226 Difference]: Without dead ends: 2348 [2019-10-13 23:22:03,896 INFO L600 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-10-13 23:22:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-10-13 23:22:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2170. [2019-10-13 23:22:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-13 23:22:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2829 transitions. [2019-10-13 23:22:04,308 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2829 transitions. Word has length 54 [2019-10-13 23:22:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:04,308 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2829 transitions. [2019-10-13 23:22:04,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2829 transitions. [2019-10-13 23:22:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:04,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:04,311 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] [2019-10-13 23:22:04,311 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1254473464, now seen corresponding path program 1 times [2019-10-13 23:22:04,313 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:04,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489959337] [2019-10-13 23:22:04,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:04,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:04,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:04,386 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-13 23:22:04,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489959337] [2019-10-13 23:22:04,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:04,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:04,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464622019] [2019-10-13 23:22:04,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:04,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:04,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:04,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:04,388 INFO L87 Difference]: Start difference. First operand 2170 states and 2829 transitions. Second operand 3 states. [2019-10-13 23:22:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:04,680 INFO L93 Difference]: Finished difference Result 4336 states and 5667 transitions. [2019-10-13 23:22:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:04,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:04,694 INFO L225 Difference]: With dead ends: 4336 [2019-10-13 23:22:04,694 INFO L226 Difference]: Without dead ends: 2729 [2019-10-13 23:22:04,699 INFO L600 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-10-13 23:22:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2019-10-13 23:22:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2505. [2019-10-13 23:22:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-10-13 23:22:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3241 transitions. [2019-10-13 23:22:05,147 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3241 transitions. Word has length 58 [2019-10-13 23:22:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:05,147 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 3241 transitions. [2019-10-13 23:22:05,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3241 transitions. [2019-10-13 23:22:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 23:22:05,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:05,150 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] [2019-10-13 23:22:05,150 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:05,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash 822343230, now seen corresponding path program 1 times [2019-10-13 23:22:05,151 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:05,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670821272] [2019-10-13 23:22:05,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:05,223 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-13 23:22:05,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670821272] [2019-10-13 23:22:05,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:05,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:05,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876900156] [2019-10-13 23:22:05,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:05,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:05,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:05,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:05,225 INFO L87 Difference]: Start difference. First operand 2505 states and 3241 transitions. Second operand 3 states. [2019-10-13 23:22:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:05,582 INFO L93 Difference]: Finished difference Result 4792 states and 6213 transitions. [2019-10-13 23:22:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:05,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-13 23:22:05,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:05,598 INFO L225 Difference]: With dead ends: 4792 [2019-10-13 23:22:05,598 INFO L226 Difference]: Without dead ends: 3443 [2019-10-13 23:22:05,604 INFO L600 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-10-13 23:22:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2019-10-13 23:22:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3262. [2019-10-13 23:22:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-10-13 23:22:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4182 transitions. [2019-10-13 23:22:06,015 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4182 transitions. Word has length 61 [2019-10-13 23:22:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:06,016 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 4182 transitions. [2019-10-13 23:22:06,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4182 transitions. [2019-10-13 23:22:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 23:22:06,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:06,017 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] [2019-10-13 23:22:06,018 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:06,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1717854949, now seen corresponding path program 1 times [2019-10-13 23:22:06,018 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:06,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271591899] [2019-10-13 23:22:06,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:06,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:06,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:06,139 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-13 23:22:06,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271591899] [2019-10-13 23:22:06,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:06,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:22:06,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264907731] [2019-10-13 23:22:06,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:22:06,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:06,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:22:06,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:22:06,142 INFO L87 Difference]: Start difference. First operand 3262 states and 4182 transitions. Second operand 10 states. [2019-10-13 23:22:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:08,139 INFO L93 Difference]: Finished difference Result 9627 states and 12352 transitions. [2019-10-13 23:22:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:22:08,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-10-13 23:22:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:08,196 INFO L225 Difference]: With dead ends: 9627 [2019-10-13 23:22:08,196 INFO L226 Difference]: Without dead ends: 6920 [2019-10-13 23:22:08,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-10-13 23:22:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6920 states. [2019-10-13 23:22:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6920 to 4747. [2019-10-13 23:22:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4747 states. [2019-10-13 23:22:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 5993 transitions. [2019-10-13 23:22:08,845 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 5993 transitions. Word has length 63 [2019-10-13 23:22:08,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:08,845 INFO L462 AbstractCegarLoop]: Abstraction has 4747 states and 5993 transitions. [2019-10-13 23:22:08,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:22:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 5993 transitions. [2019-10-13 23:22:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 23:22:08,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:08,848 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:08,848 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:08,849 INFO L82 PathProgramCache]: Analyzing trace with hash 180323707, now seen corresponding path program 1 times [2019-10-13 23:22:08,849 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:08,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984732954] [2019-10-13 23:22:08,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:08,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:08,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 23:22:08,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984732954] [2019-10-13 23:22:08,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:08,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:08,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815889041] [2019-10-13 23:22:08,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:08,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:08,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:08,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:08,906 INFO L87 Difference]: Start difference. First operand 4747 states and 5993 transitions. Second operand 3 states. [2019-10-13 23:22:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:10,057 INFO L93 Difference]: Finished difference Result 8017 states and 10142 transitions. [2019-10-13 23:22:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:10,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-13 23:22:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:10,068 INFO L225 Difference]: With dead ends: 8017 [2019-10-13 23:22:10,068 INFO L226 Difference]: Without dead ends: 4915 [2019-10-13 23:22:10,076 INFO L600 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-10-13 23:22:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2019-10-13 23:22:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4608. [2019-10-13 23:22:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4608 states. [2019-10-13 23:22:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 5764 transitions. [2019-10-13 23:22:10,712 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 5764 transitions. Word has length 73 [2019-10-13 23:22:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:10,713 INFO L462 AbstractCegarLoop]: Abstraction has 4608 states and 5764 transitions. [2019-10-13 23:22:10,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 5764 transitions. [2019-10-13 23:22:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 23:22:10,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:10,715 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:10,716 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:10,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1697580780, now seen corresponding path program 1 times [2019-10-13 23:22:10,716 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:10,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504452631] [2019-10-13 23:22:10,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:11,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504452631] [2019-10-13 23:22:11,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802546722] [2019-10-13 23:22:11,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:22:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:11,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-13 23:22:11,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:22:11,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:11,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:11,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 23:22:12,181 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:22:12,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:12,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:13,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:22:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 23:22:13,235 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 23:22:13,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18, 14] imperfect sequences [14] total 42 [2019-10-13 23:22:13,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944993005] [2019-10-13 23:22:13,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-13 23:22:13,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:13,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-13 23:22:13,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2019-10-13 23:22:13,237 INFO L87 Difference]: Start difference. First operand 4608 states and 5764 transitions. Second operand 30 states. [2019-10-13 23:22:14,332 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-10-13 23:22:14,505 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-10-13 23:22:15,174 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-13 23:22:15,351 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-10-13 23:22:15,789 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2019-10-13 23:22:15,986 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35