/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:41:45,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:41:45,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:41:45,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:41:45,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:41:45,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:41:45,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:41:45,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:41:45,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:41:45,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:41:45,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:41:45,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:41:45,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:41:45,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:41:45,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:41:45,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:41:45,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:41:45,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:41:45,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:41:45,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:41:45,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:41:45,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:41:45,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:41:45,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:41:45,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:41:45,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:41:45,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:41:45,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:41:45,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:41:45,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:41:45,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:41:45,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:41:45,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:41:45,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:41:45,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:41:45,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:41:45,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:41:45,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:41:45,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:41:45,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:41:45,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:41:45,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 04:41:45,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:41:45,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:41:45,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:41:45,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:41:45,132 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:41:45,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:41:45,133 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:41:45,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:41:45,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:41:45,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:41:45,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:41:45,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:41:45,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:41:45,134 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:41:45,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:41:45,134 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:41:45,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:41:45,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:41:45,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:41:45,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:41:45,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:41:45,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:41:45,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:41:45,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:41:45,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:41:45,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:41:45,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:41:45,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:41:45,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 04:41:45,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:41:45,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:41:45,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:41:45,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:41:45,444 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:41:45,445 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-11-07 04:41:45,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c50e3edb/5ed46e578b7b45c6a4a8c22b028dd228/FLAG4fafb932c [2019-11-07 04:41:46,041 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:41:46,042 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-11-07 04:41:46,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c50e3edb/5ed46e578b7b45c6a4a8c22b028dd228/FLAG4fafb932c [2019-11-07 04:41:46,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c50e3edb/5ed46e578b7b45c6a4a8c22b028dd228 [2019-11-07 04:41:46,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:41:46,360 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:41:46,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:46,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:41:46,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:41:46,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:46,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2d1ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46, skipping insertion in model container [2019-11-07 04:41:46,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:46,379 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:41:46,445 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:41:46,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:46,880 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:41:46,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:46,986 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:41:46,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46 WrapperNode [2019-11-07 04:41:46,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:46,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:41:46,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:41:46,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:41:47,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:47,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:47,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:47,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:47,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:47,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:47,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:47,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:41:47,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:41:47,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:41:47,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:41:47,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:41:47,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:41:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:41:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:41:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:41:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:41:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:41:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:41:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:41:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:41:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:41:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:41:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:41:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:41:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:41:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:41:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:41:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:41:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:41:48,322 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:41:48,322 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:41:48,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:48 BoogieIcfgContainer [2019-11-07 04:41:48,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:41:48,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:41:48,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:41:48,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:41:48,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:41:46" (1/3) ... [2019-11-07 04:41:48,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4648dbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:48, skipping insertion in model container [2019-11-07 04:41:48,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46" (2/3) ... [2019-11-07 04:41:48,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4648dbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:48, skipping insertion in model container [2019-11-07 04:41:48,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:48" (3/3) ... [2019-11-07 04:41:48,332 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 04:41:48,344 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:41:48,353 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:41:48,365 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:41:48,396 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:41:48,396 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:41:48,396 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:41:48,396 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:41:48,397 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:41:48,397 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:41:48,397 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:41:48,397 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:41:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-07 04:41:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 04:41:48,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:48,428 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:48,430 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:48,437 INFO L82 PathProgramCache]: Analyzing trace with hash -673173785, now seen corresponding path program 1 times [2019-11-07 04:41:48,446 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:48,447 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173814165] [2019-11-07 04:41:48,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:48,957 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173814165] [2019-11-07 04:41:48,958 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:48,958 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:48,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948642398] [2019-11-07 04:41:48,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:48,967 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:48,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:48,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:48,989 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 5 states. [2019-11-07 04:41:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:49,269 INFO L93 Difference]: Finished difference Result 309 states and 486 transitions. [2019-11-07 04:41:49,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:49,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-07 04:41:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:49,285 INFO L225 Difference]: With dead ends: 309 [2019-11-07 04:41:49,285 INFO L226 Difference]: Without dead ends: 225 [2019-11-07 04:41:49,289 INFO L630 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-11-07 04:41:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-07 04:41:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2019-11-07 04:41:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-07 04:41:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2019-11-07 04:41:49,362 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 46 [2019-11-07 04:41:49,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:49,363 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2019-11-07 04:41:49,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2019-11-07 04:41:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:41:49,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:49,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:49,366 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:49,367 INFO L82 PathProgramCache]: Analyzing trace with hash -182497987, now seen corresponding path program 1 times [2019-11-07 04:41:49,367 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:49,368 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935012809] [2019-11-07 04:41:49,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:49,573 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935012809] [2019-11-07 04:41:49,573 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:49,574 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:41:49,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127251561] [2019-11-07 04:41:49,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:41:49,577 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:49,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:41:49,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:41:49,578 INFO L87 Difference]: Start difference. First operand 221 states and 289 transitions. Second operand 6 states. [2019-11-07 04:41:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:49,759 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2019-11-07 04:41:49,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:49,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-07 04:41:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:49,762 INFO L225 Difference]: With dead ends: 397 [2019-11-07 04:41:49,762 INFO L226 Difference]: Without dead ends: 221 [2019-11-07 04:41:49,765 INFO L630 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-11-07 04:41:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-07 04:41:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-07 04:41:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-07 04:41:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 281 transitions. [2019-11-07 04:41:49,789 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 281 transitions. Word has length 47 [2019-11-07 04:41:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:49,789 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 281 transitions. [2019-11-07 04:41:49,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:41:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 281 transitions. [2019-11-07 04:41:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:41:49,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:49,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:49,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1648415540, now seen corresponding path program 1 times [2019-11-07 04:41:49,793 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:49,793 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435742457] [2019-11-07 04:41:49,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:49,891 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435742457] [2019-11-07 04:41:49,892 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:49,892 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:41:49,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700247164] [2019-11-07 04:41:49,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:41:49,893 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:49,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:41:49,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:41:49,894 INFO L87 Difference]: Start difference. First operand 221 states and 281 transitions. Second operand 6 states. [2019-11-07 04:41:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:50,019 INFO L93 Difference]: Finished difference Result 372 states and 477 transitions. [2019-11-07 04:41:50,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:50,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-07 04:41:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:50,021 INFO L225 Difference]: With dead ends: 372 [2019-11-07 04:41:50,022 INFO L226 Difference]: Without dead ends: 221 [2019-11-07 04:41:50,023 INFO L630 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-11-07 04:41:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-07 04:41:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-07 04:41:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-07 04:41:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 271 transitions. [2019-11-07 04:41:50,049 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 271 transitions. Word has length 47 [2019-11-07 04:41:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:50,050 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 271 transitions. [2019-11-07 04:41:50,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:41:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 271 transitions. [2019-11-07 04:41:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 04:41:50,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:50,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:50,061 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash -559064541, now seen corresponding path program 1 times [2019-11-07 04:41:50,061 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:50,062 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229757180] [2019-11-07 04:41:50,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:50,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229757180] [2019-11-07 04:41:50,177 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:50,177 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:50,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171553343] [2019-11-07 04:41:50,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:50,178 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:50,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:50,179 INFO L87 Difference]: Start difference. First operand 221 states and 271 transitions. Second operand 5 states. [2019-11-07 04:41:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:50,325 INFO L93 Difference]: Finished difference Result 358 states and 448 transitions. [2019-11-07 04:41:50,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:50,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-07 04:41:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:50,329 INFO L225 Difference]: With dead ends: 358 [2019-11-07 04:41:50,329 INFO L226 Difference]: Without dead ends: 221 [2019-11-07 04:41:50,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:41:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-07 04:41:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-07 04:41:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-07 04:41:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2019-11-07 04:41:50,355 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 48 [2019-11-07 04:41:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:50,356 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2019-11-07 04:41:50,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2019-11-07 04:41:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 04:41:50,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:50,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:50,358 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:50,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:50,358 INFO L82 PathProgramCache]: Analyzing trace with hash -852097956, now seen corresponding path program 1 times [2019-11-07 04:41:50,358 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:50,358 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514828102] [2019-11-07 04:41:50,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:50,592 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514828102] [2019-11-07 04:41:50,593 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:50,593 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:41:50,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401621277] [2019-11-07 04:41:50,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:41:50,594 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:50,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:41:50,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:41:50,595 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand 11 states. [2019-11-07 04:41:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:51,072 INFO L93 Difference]: Finished difference Result 405 states and 502 transitions. [2019-11-07 04:41:51,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:41:51,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-11-07 04:41:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:51,076 INFO L225 Difference]: With dead ends: 405 [2019-11-07 04:41:51,076 INFO L226 Difference]: Without dead ends: 348 [2019-11-07 04:41:51,077 INFO L630 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-11-07 04:41:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-11-07 04:41:51,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 281. [2019-11-07 04:41:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-07 04:41:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2019-11-07 04:41:51,104 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 48 [2019-11-07 04:41:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:51,104 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2019-11-07 04:41:51,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:41:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2019-11-07 04:41:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 04:41:51,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:51,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:51,106 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:51,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:51,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1927649468, now seen corresponding path program 1 times [2019-11-07 04:41:51,106 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:51,106 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632893734] [2019-11-07 04:41:51,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:51,352 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632893734] [2019-11-07 04:41:51,352 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:51,353 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:41:51,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763504310] [2019-11-07 04:41:51,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:41:51,353 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:41:51,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:41:51,354 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 10 states. [2019-11-07 04:41:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:51,898 INFO L93 Difference]: Finished difference Result 540 states and 663 transitions. [2019-11-07 04:41:51,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:41:51,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-11-07 04:41:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:51,903 INFO L225 Difference]: With dead ends: 540 [2019-11-07 04:41:51,903 INFO L226 Difference]: Without dead ends: 513 [2019-11-07 04:41:51,904 INFO L630 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-11-07 04:41:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-11-07 04:41:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 368. [2019-11-07 04:41:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-07 04:41:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 449 transitions. [2019-11-07 04:41:51,939 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 449 transitions. Word has length 48 [2019-11-07 04:41:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:51,939 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 449 transitions. [2019-11-07 04:41:51,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:41:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 449 transitions. [2019-11-07 04:41:51,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 04:41:51,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:51,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:51,941 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:51,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:51,941 INFO L82 PathProgramCache]: Analyzing trace with hash 162391591, now seen corresponding path program 1 times [2019-11-07 04:41:51,942 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:51,942 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614453299] [2019-11-07 04:41:51,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:52,159 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614453299] [2019-11-07 04:41:52,159 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:52,159 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:41:52,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138304566] [2019-11-07 04:41:52,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:41:52,161 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:52,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:41:52,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:41:52,161 INFO L87 Difference]: Start difference. First operand 368 states and 449 transitions. Second operand 10 states. [2019-11-07 04:41:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:53,057 INFO L93 Difference]: Finished difference Result 960 states and 1235 transitions. [2019-11-07 04:41:53,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:41:53,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-11-07 04:41:53,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:53,068 INFO L225 Difference]: With dead ends: 960 [2019-11-07 04:41:53,068 INFO L226 Difference]: Without dead ends: 866 [2019-11-07 04:41:53,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-11-07 04:41:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-11-07 04:41:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 635. [2019-11-07 04:41:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-11-07 04:41:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 797 transitions. [2019-11-07 04:41:53,139 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 797 transitions. Word has length 49 [2019-11-07 04:41:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:53,140 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 797 transitions. [2019-11-07 04:41:53,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:41:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 797 transitions. [2019-11-07 04:41:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:41:53,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:53,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:53,142 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:53,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1780212977, now seen corresponding path program 1 times [2019-11-07 04:41:53,143 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:53,143 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147488064] [2019-11-07 04:41:53,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:53,432 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147488064] [2019-11-07 04:41:53,432 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:53,432 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:41:53,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862638103] [2019-11-07 04:41:53,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:41:53,434 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:53,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:41:53,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:41:53,435 INFO L87 Difference]: Start difference. First operand 635 states and 797 transitions. Second operand 12 states. [2019-11-07 04:41:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:54,331 INFO L93 Difference]: Finished difference Result 988 states and 1245 transitions. [2019-11-07 04:41:54,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:41:54,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-07 04:41:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:54,338 INFO L225 Difference]: With dead ends: 988 [2019-11-07 04:41:54,338 INFO L226 Difference]: Without dead ends: 932 [2019-11-07 04:41:54,339 INFO L630 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-11-07 04:41:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-11-07 04:41:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 635. [2019-11-07 04:41:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-11-07 04:41:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 795 transitions. [2019-11-07 04:41:54,440 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 795 transitions. Word has length 50 [2019-11-07 04:41:54,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:54,441 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 795 transitions. [2019-11-07 04:41:54,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:41:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 795 transitions. [2019-11-07 04:41:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 04:41:54,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:54,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:54,443 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1032655972, now seen corresponding path program 1 times [2019-11-07 04:41:54,443 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:54,443 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95171269] [2019-11-07 04:41:54,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:54,674 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95171269] [2019-11-07 04:41:54,676 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:54,676 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:41:54,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45218939] [2019-11-07 04:41:54,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:41:54,677 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:54,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:41:54,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:41:54,678 INFO L87 Difference]: Start difference. First operand 635 states and 795 transitions. Second operand 12 states. [2019-11-07 04:41:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:55,234 INFO L93 Difference]: Finished difference Result 1925 states and 2481 transitions. [2019-11-07 04:41:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 04:41:55,235 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-11-07 04:41:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:55,243 INFO L225 Difference]: With dead ends: 1925 [2019-11-07 04:41:55,243 INFO L226 Difference]: Without dead ends: 1584 [2019-11-07 04:41:55,245 INFO L630 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-11-07 04:41:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-11-07 04:41:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1054. [2019-11-07 04:41:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-11-07 04:41:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1348 transitions. [2019-11-07 04:41:55,373 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1348 transitions. Word has length 51 [2019-11-07 04:41:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:55,374 INFO L462 AbstractCegarLoop]: Abstraction has 1054 states and 1348 transitions. [2019-11-07 04:41:55,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:41:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1348 transitions. [2019-11-07 04:41:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 04:41:55,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:55,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:55,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1747091452, now seen corresponding path program 1 times [2019-11-07 04:41:55,376 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:55,376 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177703276] [2019-11-07 04:41:55,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:55,594 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177703276] [2019-11-07 04:41:55,595 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:55,595 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:41:55,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423471148] [2019-11-07 04:41:55,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:41:55,596 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:55,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:41:55,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:41:55,597 INFO L87 Difference]: Start difference. First operand 1054 states and 1348 transitions. Second operand 12 states. [2019-11-07 04:41:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:56,550 INFO L93 Difference]: Finished difference Result 1574 states and 2014 transitions. [2019-11-07 04:41:56,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-07 04:41:56,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-11-07 04:41:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:56,558 INFO L225 Difference]: With dead ends: 1574 [2019-11-07 04:41:56,559 INFO L226 Difference]: Without dead ends: 1480 [2019-11-07 04:41:56,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-11-07 04:41:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-11-07 04:41:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1069. [2019-11-07 04:41:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-11-07 04:41:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1363 transitions. [2019-11-07 04:41:56,664 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1363 transitions. Word has length 51 [2019-11-07 04:41:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:56,665 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 1363 transitions. [2019-11-07 04:41:56,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:41:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1363 transitions. [2019-11-07 04:41:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 04:41:56,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:56,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:56,666 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:56,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1583938470, now seen corresponding path program 1 times [2019-11-07 04:41:56,667 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:56,667 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793958844] [2019-11-07 04:41:56,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:56,707 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793958844] [2019-11-07 04:41:56,707 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:56,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:41:56,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147462677] [2019-11-07 04:41:56,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:41:56,708 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:56,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:41:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:56,709 INFO L87 Difference]: Start difference. First operand 1069 states and 1363 transitions. Second operand 3 states. [2019-11-07 04:41:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:56,883 INFO L93 Difference]: Finished difference Result 2403 states and 3130 transitions. [2019-11-07 04:41:56,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:41:56,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-07 04:41:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:56,895 INFO L225 Difference]: With dead ends: 2403 [2019-11-07 04:41:56,895 INFO L226 Difference]: Without dead ends: 1570 [2019-11-07 04:41:56,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-11-07 04:41:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1566. [2019-11-07 04:41:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-11-07 04:41:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2025 transitions. [2019-11-07 04:41:57,130 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2025 transitions. Word has length 52 [2019-11-07 04:41:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:57,130 INFO L462 AbstractCegarLoop]: Abstraction has 1566 states and 2025 transitions. [2019-11-07 04:41:57,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:41:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2025 transitions. [2019-11-07 04:41:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:41:57,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:57,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:57,131 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash 62651441, now seen corresponding path program 1 times [2019-11-07 04:41:57,132 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:57,132 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909949602] [2019-11-07 04:41:57,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:58,078 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-11-07 04:41:58,593 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-07 04:41:58,790 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-07 04:41:58,956 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-07 04:41:59,149 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-11-07 04:41:59,337 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-11-07 04:41:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:59,974 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909949602] [2019-11-07 04:41:59,974 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:59,975 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-11-07 04:41:59,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867924161] [2019-11-07 04:41:59,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-07 04:41:59,975 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-07 04:41:59,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-11-07 04:41:59,976 INFO L87 Difference]: Start difference. First operand 1566 states and 2025 transitions. Second operand 25 states. [2019-11-07 04:42:00,117 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-07 04:42:00,587 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-07 04:42:00,760 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-11-07 04:42:00,925 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-11-07 04:42:01,097 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-11-07 04:42:01,427 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-11-07 04:42:01,917 WARN L191 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-11-07 04:42:02,431 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-11-07 04:42:02,910 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-11-07 04:42:03,418 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2019-11-07 04:42:04,071 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2019-11-07 04:42:04,565 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-11-07 04:42:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:07,530 INFO L93 Difference]: Finished difference Result 3795 states and 4950 transitions. [2019-11-07 04:42:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-07 04:42:07,531 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2019-11-07 04:42:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:07,548 INFO L225 Difference]: With dead ends: 3795 [2019-11-07 04:42:07,548 INFO L226 Difference]: Without dead ends: 3617 [2019-11-07 04:42:07,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=474, Invalid=1166, Unknown=0, NotChecked=0, Total=1640 [2019-11-07 04:42:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2019-11-07 04:42:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 1563. [2019-11-07 04:42:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-11-07 04:42:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2022 transitions. [2019-11-07 04:42:07,785 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2022 transitions. Word has length 53 [2019-11-07 04:42:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:07,785 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 2022 transitions. [2019-11-07 04:42:07,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-07 04:42:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2022 transitions. [2019-11-07 04:42:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:07,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:07,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:07,787 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:07,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash -821953624, now seen corresponding path program 1 times [2019-11-07 04:42:07,788 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:07,788 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579206534] [2019-11-07 04:42:07,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:07,834 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579206534] [2019-11-07 04:42:07,835 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:07,835 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:07,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356052698] [2019-11-07 04:42:07,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:07,836 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:07,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:07,837 INFO L87 Difference]: Start difference. First operand 1563 states and 2022 transitions. Second operand 3 states. [2019-11-07 04:42:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:08,144 INFO L93 Difference]: Finished difference Result 3492 states and 4570 transitions. [2019-11-07 04:42:08,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:08,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-07 04:42:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:08,155 INFO L225 Difference]: With dead ends: 3492 [2019-11-07 04:42:08,156 INFO L226 Difference]: Without dead ends: 2348 [2019-11-07 04:42:08,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-11-07 04:42:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2170. [2019-11-07 04:42:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-11-07 04:42:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2829 transitions. [2019-11-07 04:42:08,396 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2829 transitions. Word has length 54 [2019-11-07 04:42:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:08,397 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2829 transitions. [2019-11-07 04:42:08,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2829 transitions. [2019-11-07 04:42:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:08,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:08,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:08,399 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1254473464, now seen corresponding path program 1 times [2019-11-07 04:42:08,399 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:08,400 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22306124] [2019-11-07 04:42:08,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:08,461 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22306124] [2019-11-07 04:42:08,461 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:08,462 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:08,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170723070] [2019-11-07 04:42:08,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:08,462 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:08,463 INFO L87 Difference]: Start difference. First operand 2170 states and 2829 transitions. Second operand 3 states. [2019-11-07 04:42:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:08,766 INFO L93 Difference]: Finished difference Result 4336 states and 5667 transitions. [2019-11-07 04:42:08,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:08,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:08,778 INFO L225 Difference]: With dead ends: 4336 [2019-11-07 04:42:08,778 INFO L226 Difference]: Without dead ends: 2729 [2019-11-07 04:42:08,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2019-11-07 04:42:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2505. [2019-11-07 04:42:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-11-07 04:42:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3241 transitions. [2019-11-07 04:42:09,169 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3241 transitions. Word has length 58 [2019-11-07 04:42:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:09,170 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 3241 transitions. [2019-11-07 04:42:09,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3241 transitions. [2019-11-07 04:42:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-07 04:42:09,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:09,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:09,173 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:09,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:09,173 INFO L82 PathProgramCache]: Analyzing trace with hash 822343230, now seen corresponding path program 1 times [2019-11-07 04:42:09,173 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:09,173 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126787486] [2019-11-07 04:42:09,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:09,263 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126787486] [2019-11-07 04:42:09,264 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:09,264 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:09,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860019304] [2019-11-07 04:42:09,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:09,265 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:09,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:09,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:09,265 INFO L87 Difference]: Start difference. First operand 2505 states and 3241 transitions. Second operand 3 states. [2019-11-07 04:42:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:09,635 INFO L93 Difference]: Finished difference Result 4792 states and 6213 transitions. [2019-11-07 04:42:09,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:09,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-07 04:42:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:09,648 INFO L225 Difference]: With dead ends: 4792 [2019-11-07 04:42:09,648 INFO L226 Difference]: Without dead ends: 3443 [2019-11-07 04:42:09,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2019-11-07 04:42:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3262. [2019-11-07 04:42:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-11-07 04:42:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4182 transitions. [2019-11-07 04:42:10,027 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4182 transitions. Word has length 61 [2019-11-07 04:42:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:10,028 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 4182 transitions. [2019-11-07 04:42:10,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4182 transitions. [2019-11-07 04:42:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-07 04:42:10,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:10,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:10,030 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:10,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1717854949, now seen corresponding path program 1 times [2019-11-07 04:42:10,031 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:10,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430270800] [2019-11-07 04:42:10,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:10,165 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430270800] [2019-11-07 04:42:10,167 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:10,168 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:42:10,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953560343] [2019-11-07 04:42:10,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:42:10,169 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:10,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:42:10,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:42:10,169 INFO L87 Difference]: Start difference. First operand 3262 states and 4182 transitions. Second operand 10 states. [2019-11-07 04:42:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:11,862 INFO L93 Difference]: Finished difference Result 9627 states and 12352 transitions. [2019-11-07 04:42:11,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-07 04:42:11,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-11-07 04:42:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:11,906 INFO L225 Difference]: With dead ends: 9627 [2019-11-07 04:42:11,906 INFO L226 Difference]: Without dead ends: 6920 [2019-11-07 04:42:11,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-11-07 04:42:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6920 states. [2019-11-07 04:42:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6920 to 4747. [2019-11-07 04:42:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4747 states. [2019-11-07 04:42:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 5993 transitions. [2019-11-07 04:42:12,496 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 5993 transitions. Word has length 63 [2019-11-07 04:42:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:12,497 INFO L462 AbstractCegarLoop]: Abstraction has 4747 states and 5993 transitions. [2019-11-07 04:42:12,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:42:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 5993 transitions. [2019-11-07 04:42:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-07 04:42:12,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:12,499 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:12,499 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:12,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:12,500 INFO L82 PathProgramCache]: Analyzing trace with hash 180323707, now seen corresponding path program 1 times [2019-11-07 04:42:12,500 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:12,500 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205306227] [2019-11-07 04:42:12,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 04:42:12,569 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205306227] [2019-11-07 04:42:12,569 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:12,569 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:12,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447741513] [2019-11-07 04:42:12,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:12,570 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:12,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:12,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:12,571 INFO L87 Difference]: Start difference. First operand 4747 states and 5993 transitions. Second operand 3 states. [2019-11-07 04:42:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:13,702 INFO L93 Difference]: Finished difference Result 8017 states and 10142 transitions. [2019-11-07 04:42:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:13,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-07 04:42:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:13,715 INFO L225 Difference]: With dead ends: 8017 [2019-11-07 04:42:13,715 INFO L226 Difference]: Without dead ends: 4915 [2019-11-07 04:42:13,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2019-11-07 04:42:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4608. [2019-11-07 04:42:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4608 states. [2019-11-07 04:42:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 5764 transitions. [2019-11-07 04:42:14,374 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 5764 transitions. Word has length 73 [2019-11-07 04:42:14,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:14,374 INFO L462 AbstractCegarLoop]: Abstraction has 4608 states and 5764 transitions. [2019-11-07 04:42:14,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 5764 transitions. [2019-11-07 04:42:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-07 04:42:14,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:14,377 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:14,377 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:14,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:14,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1697580780, now seen corresponding path program 1 times [2019-11-07 04:42:14,378 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:14,378 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877529319] [2019-11-07 04:42:14,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:14,775 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877529319] [2019-11-07 04:42:14,775 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484799915] [2019-11-07 04:42:14,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:42:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:15,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-07 04:42:15,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:42:15,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:15,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:15,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 04:42:16,046 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:42:16,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:16,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:16,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:42:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 04:42:17,243 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 04:42:17,243 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 14] imperfect sequences [14] total 42 [2019-11-07 04:42:17,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529367126] [2019-11-07 04:42:17,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-07 04:42:17,244 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:17,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-07 04:42:17,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2019-11-07 04:42:17,245 INFO L87 Difference]: Start difference. First operand 4608 states and 5764 transitions. Second operand 30 states. [2019-11-07 04:42:18,120 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-11-07 04:42:18,339 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-11-07 04:42:19,033 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-07 04:42:19,203 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-11-07 04:42:19,645 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2019-11-07 04:42:20,445 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-11-07 04:42:21,107 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 41 [2019-11-07 04:42:21,304 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40