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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:25,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:26,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:26,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:26,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:26,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:26,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:26,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:26,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:26,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:26,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:26,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:26,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:26,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:26,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:26,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:26,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:26,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:26,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:26,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:26,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:26,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:26,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:26,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:26,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:26,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:26,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:26,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:26,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:26,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:26,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:26,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:26,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:26,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:26,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:26,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:26,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:26,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:26,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:26,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:26,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:26,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:26:26,118 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:26,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:26,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:26,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:26,124 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:26,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:26,125 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:26,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:26,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:26,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:26,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:26,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:26,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:26,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:26,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:26,127 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:26,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:26,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:26,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:26,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:26,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:26,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:26,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:26,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:26,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:26,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:26,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:26,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:26,130 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:26:26,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:26,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:26,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:26,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:26,421 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:26,422 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 03:26:26,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a33abb14/e23f4d8f3557471b9b159f351d5f96fc/FLAG989308809 [2019-10-15 03:26:27,100 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:27,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 03:26:27,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a33abb14/e23f4d8f3557471b9b159f351d5f96fc/FLAG989308809 [2019-10-15 03:26:27,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a33abb14/e23f4d8f3557471b9b159f351d5f96fc [2019-10-15 03:26:27,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:27,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:27,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:27,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:27,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:27,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:27" (1/1) ... [2019-10-15 03:26:27,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e6ce29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:27, skipping insertion in model container [2019-10-15 03:26:27,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:27" (1/1) ... [2019-10-15 03:26:27,361 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:27,459 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:28,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:28,476 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:28,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:28,829 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:28,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:28 WrapperNode [2019-10-15 03:26:28,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:28,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:28,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:28,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:28,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:28" (1/1) ... [2019-10-15 03:26:28,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:28" (1/1) ... [2019-10-15 03:26:28,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:28" (1/1) ... [2019-10-15 03:26:28,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:28" (1/1) ... [2019-10-15 03:26:28,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:28" (1/1) ... [2019-10-15 03:26:28,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:28" (1/1) ... [2019-10-15 03:26:28,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:28" (1/1) ... [2019-10-15 03:26:29,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:29,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:29,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:29,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:29,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:29,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:29,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:29,089 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 03:26:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:29,092 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:29,093 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:31,630 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:31,631 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:31,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:31 BoogieIcfgContainer [2019-10-15 03:26:31,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:31,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:31,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:31,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:31,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:27" (1/3) ... [2019-10-15 03:26:31,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7d361e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:31, skipping insertion in model container [2019-10-15 03:26:31,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:28" (2/3) ... [2019-10-15 03:26:31,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7d361e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:31, skipping insertion in model container [2019-10-15 03:26:31,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:31" (3/3) ... [2019-10-15 03:26:31,642 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 03:26:31,653 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:31,662 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-15 03:26:31,674 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-15 03:26:31,704 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:31,704 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:31,704 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:31,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:31,705 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:31,705 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:31,705 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:31,705 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states. [2019-10-15 03:26:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 03:26:31,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:31,751 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:31,753 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:31,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash -939220714, now seen corresponding path program 1 times [2019-10-15 03:26:31,768 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:31,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596813394] [2019-10-15 03:26:31,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:31,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:31,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:32,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596813394] [2019-10-15 03:26:32,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:32,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:32,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941187394] [2019-10-15 03:26:32,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:32,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:32,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:32,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:32,294 INFO L87 Difference]: Start difference. First operand 417 states. Second operand 3 states. [2019-10-15 03:26:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:32,456 INFO L93 Difference]: Finished difference Result 620 states and 1089 transitions. [2019-10-15 03:26:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:32,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-15 03:26:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:32,488 INFO L225 Difference]: With dead ends: 620 [2019-10-15 03:26:32,489 INFO L226 Difference]: Without dead ends: 491 [2019-10-15 03:26:32,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-15 03:26:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 485. [2019-10-15 03:26:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-10-15 03:26:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 624 transitions. [2019-10-15 03:26:32,614 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 624 transitions. Word has length 52 [2019-10-15 03:26:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:32,615 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 624 transitions. [2019-10-15 03:26:32,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 624 transitions. [2019-10-15 03:26:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 03:26:32,623 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:32,623 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:32,624 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:32,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash 9345795, now seen corresponding path program 1 times [2019-10-15 03:26:32,625 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:32,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352202461] [2019-10-15 03:26:32,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:32,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352202461] [2019-10-15 03:26:32,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:32,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:32,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474337003] [2019-10-15 03:26:32,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:32,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:32,843 INFO L87 Difference]: Start difference. First operand 485 states and 624 transitions. Second operand 3 states. [2019-10-15 03:26:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:32,916 INFO L93 Difference]: Finished difference Result 786 states and 1042 transitions. [2019-10-15 03:26:32,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:32,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-15 03:26:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:32,920 INFO L225 Difference]: With dead ends: 786 [2019-10-15 03:26:32,921 INFO L226 Difference]: Without dead ends: 616 [2019-10-15 03:26:32,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-15 03:26:32,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 610. [2019-10-15 03:26:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-15 03:26:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 797 transitions. [2019-10-15 03:26:32,947 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 797 transitions. Word has length 52 [2019-10-15 03:26:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:32,948 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 797 transitions. [2019-10-15 03:26:32,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 797 transitions. [2019-10-15 03:26:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 03:26:32,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:32,956 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:32,956 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1581802972, now seen corresponding path program 1 times [2019-10-15 03:26:32,958 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:32,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067974863] [2019-10-15 03:26:32,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:33,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067974863] [2019-10-15 03:26:33,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:33,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:33,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434070922] [2019-10-15 03:26:33,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:33,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:33,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:33,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:33,216 INFO L87 Difference]: Start difference. First operand 610 states and 797 transitions. Second operand 10 states. [2019-10-15 03:26:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:35,241 INFO L93 Difference]: Finished difference Result 1611 states and 2204 transitions. [2019-10-15 03:26:35,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 03:26:35,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-10-15 03:26:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:35,250 INFO L225 Difference]: With dead ends: 1611 [2019-10-15 03:26:35,250 INFO L226 Difference]: Without dead ends: 1521 [2019-10-15 03:26:35,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-10-15 03:26:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-10-15 03:26:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 621. [2019-10-15 03:26:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-15 03:26:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 811 transitions. [2019-10-15 03:26:35,290 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 811 transitions. Word has length 52 [2019-10-15 03:26:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:35,291 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 811 transitions. [2019-10-15 03:26:35,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 811 transitions. [2019-10-15 03:26:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:26:35,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:35,293 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:35,294 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:35,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:35,294 INFO L82 PathProgramCache]: Analyzing trace with hash 666756999, now seen corresponding path program 1 times [2019-10-15 03:26:35,295 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:35,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268456887] [2019-10-15 03:26:35,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:35,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:35,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:35,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268456887] [2019-10-15 03:26:35,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:35,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:35,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729021647] [2019-10-15 03:26:35,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:35,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:35,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:35,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:35,387 INFO L87 Difference]: Start difference. First operand 621 states and 811 transitions. Second operand 3 states. [2019-10-15 03:26:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:35,498 INFO L93 Difference]: Finished difference Result 1096 states and 1460 transitions. [2019-10-15 03:26:35,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:35,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-15 03:26:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:35,503 INFO L225 Difference]: With dead ends: 1096 [2019-10-15 03:26:35,504 INFO L226 Difference]: Without dead ends: 867 [2019-10-15 03:26:35,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-10-15 03:26:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 860. [2019-10-15 03:26:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-10-15 03:26:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1131 transitions. [2019-10-15 03:26:35,554 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1131 transitions. Word has length 53 [2019-10-15 03:26:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:35,555 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1131 transitions. [2019-10-15 03:26:35,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1131 transitions. [2019-10-15 03:26:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:26:35,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:35,558 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:35,558 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash 560716068, now seen corresponding path program 1 times [2019-10-15 03:26:35,559 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:35,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902602686] [2019-10-15 03:26:35,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:35,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:35,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:35,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902602686] [2019-10-15 03:26:35,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:35,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:35,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36843155] [2019-10-15 03:26:35,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:35,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:35,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:35,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:35,791 INFO L87 Difference]: Start difference. First operand 860 states and 1131 transitions. Second operand 10 states. [2019-10-15 03:26:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:37,372 INFO L93 Difference]: Finished difference Result 1823 states and 2421 transitions. [2019-10-15 03:26:37,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:26:37,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-15 03:26:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:37,380 INFO L225 Difference]: With dead ends: 1823 [2019-10-15 03:26:37,381 INFO L226 Difference]: Without dead ends: 1684 [2019-10-15 03:26:37,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:26:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-10-15 03:26:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 860. [2019-10-15 03:26:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-10-15 03:26:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1131 transitions. [2019-10-15 03:26:37,443 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1131 transitions. Word has length 53 [2019-10-15 03:26:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:37,443 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1131 transitions. [2019-10-15 03:26:37,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1131 transitions. [2019-10-15 03:26:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:26:37,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:37,446 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:37,447 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1009485033, now seen corresponding path program 1 times [2019-10-15 03:26:37,447 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:37,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827845590] [2019-10-15 03:26:37,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:37,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:37,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:37,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827845590] [2019-10-15 03:26:37,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:37,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:26:37,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600916456] [2019-10-15 03:26:37,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:26:37,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:37,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:26:37,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:26:37,654 INFO L87 Difference]: Start difference. First operand 860 states and 1131 transitions. Second operand 12 states. [2019-10-15 03:26:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:40,911 INFO L93 Difference]: Finished difference Result 2593 states and 3482 transitions. [2019-10-15 03:26:40,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 03:26:40,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-10-15 03:26:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:40,923 INFO L225 Difference]: With dead ends: 2593 [2019-10-15 03:26:40,923 INFO L226 Difference]: Without dead ends: 2471 [2019-10-15 03:26:40,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-10-15 03:26:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-10-15 03:26:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 876. [2019-10-15 03:26:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-15 03:26:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1154 transitions. [2019-10-15 03:26:41,032 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1154 transitions. Word has length 53 [2019-10-15 03:26:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:41,033 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1154 transitions. [2019-10-15 03:26:41,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:26:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1154 transitions. [2019-10-15 03:26:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:26:41,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:41,035 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:41,036 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1713025086, now seen corresponding path program 1 times [2019-10-15 03:26:41,036 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:41,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595625821] [2019-10-15 03:26:41,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:41,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:41,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:41,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595625821] [2019-10-15 03:26:41,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:41,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:41,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104306828] [2019-10-15 03:26:41,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:41,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:41,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:41,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:41,165 INFO L87 Difference]: Start difference. First operand 876 states and 1154 transitions. Second operand 9 states. [2019-10-15 03:26:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:42,555 INFO L93 Difference]: Finished difference Result 3059 states and 4131 transitions. [2019-10-15 03:26:42,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:26:42,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-10-15 03:26:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:42,567 INFO L225 Difference]: With dead ends: 3059 [2019-10-15 03:26:42,567 INFO L226 Difference]: Without dead ends: 2491 [2019-10-15 03:26:42,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:26:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2019-10-15 03:26:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 1818. [2019-10-15 03:26:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1818 states. [2019-10-15 03:26:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2449 transitions. [2019-10-15 03:26:42,743 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2449 transitions. Word has length 53 [2019-10-15 03:26:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:42,744 INFO L462 AbstractCegarLoop]: Abstraction has 1818 states and 2449 transitions. [2019-10-15 03:26:42,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2449 transitions. [2019-10-15 03:26:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:42,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:42,747 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:42,748 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:42,748 INFO L82 PathProgramCache]: Analyzing trace with hash -9109944, now seen corresponding path program 1 times [2019-10-15 03:26:42,748 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:42,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959292563] [2019-10-15 03:26:42,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:42,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:42,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:42,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959292563] [2019-10-15 03:26:42,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:42,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:26:42,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669173029] [2019-10-15 03:26:42,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:26:42,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:42,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:26:42,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:42,857 INFO L87 Difference]: Start difference. First operand 1818 states and 2449 transitions. Second operand 7 states. [2019-10-15 03:26:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:44,256 INFO L93 Difference]: Finished difference Result 4552 states and 6282 transitions. [2019-10-15 03:26:44,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:26:44,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-10-15 03:26:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:44,275 INFO L225 Difference]: With dead ends: 4552 [2019-10-15 03:26:44,275 INFO L226 Difference]: Without dead ends: 4309 [2019-10-15 03:26:44,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:26:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2019-10-15 03:26:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 1819. [2019-10-15 03:26:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2019-10-15 03:26:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2451 transitions. [2019-10-15 03:26:44,525 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2451 transitions. Word has length 54 [2019-10-15 03:26:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:44,525 INFO L462 AbstractCegarLoop]: Abstraction has 1819 states and 2451 transitions. [2019-10-15 03:26:44,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:26:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2451 transitions. [2019-10-15 03:26:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:44,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:44,529 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:44,529 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash -655737991, now seen corresponding path program 1 times [2019-10-15 03:26:44,530 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:44,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328552941] [2019-10-15 03:26:44,530 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:44,530 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:44,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:44,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328552941] [2019-10-15 03:26:44,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:44,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:44,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477515924] [2019-10-15 03:26:44,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:44,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:44,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:44,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:44,692 INFO L87 Difference]: Start difference. First operand 1819 states and 2451 transitions. Second operand 9 states. [2019-10-15 03:26:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:46,175 INFO L93 Difference]: Finished difference Result 4073 states and 5514 transitions. [2019-10-15 03:26:46,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:26:46,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-15 03:26:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:46,187 INFO L225 Difference]: With dead ends: 4073 [2019-10-15 03:26:46,187 INFO L226 Difference]: Without dead ends: 3737 [2019-10-15 03:26:46,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:26:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2019-10-15 03:26:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 1834. [2019-10-15 03:26:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2019-10-15 03:26:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2473 transitions. [2019-10-15 03:26:46,505 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2473 transitions. Word has length 54 [2019-10-15 03:26:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:46,506 INFO L462 AbstractCegarLoop]: Abstraction has 1834 states and 2473 transitions. [2019-10-15 03:26:46,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2473 transitions. [2019-10-15 03:26:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:46,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:46,511 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:46,512 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash 756516257, now seen corresponding path program 1 times [2019-10-15 03:26:46,515 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:46,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436772248] [2019-10-15 03:26:46,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:46,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:46,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:46,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436772248] [2019-10-15 03:26:46,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:46,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:46,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686360244] [2019-10-15 03:26:46,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:46,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:46,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:46,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:46,618 INFO L87 Difference]: Start difference. First operand 1834 states and 2473 transitions. Second operand 6 states. [2019-10-15 03:26:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:47,317 INFO L93 Difference]: Finished difference Result 2951 states and 4007 transitions. [2019-10-15 03:26:47,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:47,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-15 03:26:47,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:47,325 INFO L225 Difference]: With dead ends: 2951 [2019-10-15 03:26:47,326 INFO L226 Difference]: Without dead ends: 1707 [2019-10-15 03:26:47,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-10-15 03:26:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1270. [2019-10-15 03:26:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-10-15 03:26:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1694 transitions. [2019-10-15 03:26:47,500 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1694 transitions. Word has length 54 [2019-10-15 03:26:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:47,500 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 1694 transitions. [2019-10-15 03:26:47,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1694 transitions. [2019-10-15 03:26:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:47,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:47,503 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:47,503 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:47,503 INFO L82 PathProgramCache]: Analyzing trace with hash -280556856, now seen corresponding path program 1 times [2019-10-15 03:26:47,504 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:47,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170449445] [2019-10-15 03:26:47,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:47,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:47,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:47,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170449445] [2019-10-15 03:26:47,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:47,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:47,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330481936] [2019-10-15 03:26:47,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:47,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:47,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:47,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:47,637 INFO L87 Difference]: Start difference. First operand 1270 states and 1694 transitions. Second operand 10 states. [2019-10-15 03:26:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:50,946 INFO L93 Difference]: Finished difference Result 5723 states and 7880 transitions. [2019-10-15 03:26:50,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 03:26:50,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-15 03:26:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:50,965 INFO L225 Difference]: With dead ends: 5723 [2019-10-15 03:26:50,965 INFO L226 Difference]: Without dead ends: 5403 [2019-10-15 03:26:50,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-10-15 03:26:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-10-15 03:26:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 1270. [2019-10-15 03:26:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-10-15 03:26:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1694 transitions. [2019-10-15 03:26:51,197 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1694 transitions. Word has length 54 [2019-10-15 03:26:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:51,198 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 1694 transitions. [2019-10-15 03:26:51,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1694 transitions. [2019-10-15 03:26:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:51,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:51,200 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:51,201 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:51,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1957398696, now seen corresponding path program 1 times [2019-10-15 03:26:51,201 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:51,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765391914] [2019-10-15 03:26:51,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:51,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765391914] [2019-10-15 03:26:51,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:51,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:51,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034976123] [2019-10-15 03:26:51,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:51,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:51,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:51,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:51,343 INFO L87 Difference]: Start difference. First operand 1270 states and 1694 transitions. Second operand 9 states. [2019-10-15 03:26:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:53,014 INFO L93 Difference]: Finished difference Result 5418 states and 7321 transitions. [2019-10-15 03:26:53,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:26:53,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-15 03:26:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:53,032 INFO L225 Difference]: With dead ends: 5418 [2019-10-15 03:26:53,032 INFO L226 Difference]: Without dead ends: 4390 [2019-10-15 03:26:53,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:26:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-10-15 03:26:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 3039. [2019-10-15 03:26:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3039 states. [2019-10-15 03:26:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4094 transitions. [2019-10-15 03:26:53,498 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4094 transitions. Word has length 54 [2019-10-15 03:26:53,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:53,499 INFO L462 AbstractCegarLoop]: Abstraction has 3039 states and 4094 transitions. [2019-10-15 03:26:53,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4094 transitions. [2019-10-15 03:26:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:53,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:53,503 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:53,503 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:53,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1389548947, now seen corresponding path program 1 times [2019-10-15 03:26:53,504 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:53,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697248798] [2019-10-15 03:26:53,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:53,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:53,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:53,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697248798] [2019-10-15 03:26:53,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:53,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:53,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115031939] [2019-10-15 03:26:53,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:53,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:53,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:53,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:53,618 INFO L87 Difference]: Start difference. First operand 3039 states and 4094 transitions. Second operand 9 states. [2019-10-15 03:26:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:57,622 INFO L93 Difference]: Finished difference Result 11909 states and 16000 transitions. [2019-10-15 03:26:57,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:26:57,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-15 03:26:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:57,647 INFO L225 Difference]: With dead ends: 11909 [2019-10-15 03:26:57,647 INFO L226 Difference]: Without dead ends: 10979 [2019-10-15 03:26:57,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:26:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10979 states. [2019-10-15 03:26:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10979 to 3053. [2019-10-15 03:26:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2019-10-15 03:26:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 4112 transitions. [2019-10-15 03:26:58,328 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 4112 transitions. Word has length 54 [2019-10-15 03:26:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:58,328 INFO L462 AbstractCegarLoop]: Abstraction has 3053 states and 4112 transitions. [2019-10-15 03:26:58,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 4112 transitions. [2019-10-15 03:26:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:58,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:58,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:58,333 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:58,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1368275445, now seen corresponding path program 1 times [2019-10-15 03:26:58,334 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:58,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249732663] [2019-10-15 03:26:58,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:58,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:58,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:58,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249732663] [2019-10-15 03:26:58,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:58,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:26:58,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115512381] [2019-10-15 03:26:58,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:26:58,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:58,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:26:58,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:58,429 INFO L87 Difference]: Start difference. First operand 3053 states and 4112 transitions. Second operand 7 states. [2019-10-15 03:27:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:01,264 INFO L93 Difference]: Finished difference Result 9397 states and 12860 transitions. [2019-10-15 03:27:01,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:27:01,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-15 03:27:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:01,282 INFO L225 Difference]: With dead ends: 9397 [2019-10-15 03:27:01,282 INFO L226 Difference]: Without dead ends: 8587 [2019-10-15 03:27:01,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:27:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2019-10-15 03:27:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 3053. [2019-10-15 03:27:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2019-10-15 03:27:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 4112 transitions. [2019-10-15 03:27:01,970 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 4112 transitions. Word has length 55 [2019-10-15 03:27:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:01,970 INFO L462 AbstractCegarLoop]: Abstraction has 3053 states and 4112 transitions. [2019-10-15 03:27:01,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:27:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 4112 transitions. [2019-10-15 03:27:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:27:01,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:01,974 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:01,975 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:01,975 INFO L82 PathProgramCache]: Analyzing trace with hash 700602732, now seen corresponding path program 1 times [2019-10-15 03:27:01,975 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:01,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539228265] [2019-10-15 03:27:01,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:01,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:01,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:02,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539228265] [2019-10-15 03:27:02,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:02,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:27:02,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10107794] [2019-10-15 03:27:02,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:27:02,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:02,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:27:02,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:27:02,056 INFO L87 Difference]: Start difference. First operand 3053 states and 4112 transitions. Second operand 6 states.