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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -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-13a467a-m [2019-10-15 01:22:56,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:56,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:56,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:56,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:56,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:56,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:56,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:56,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:56,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:56,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:56,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:56,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:56,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:56,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:56,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:56,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:56,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:56,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:56,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:56,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:56,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:56,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:56,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:56,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:56,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:56,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:56,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:56,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:56,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:56,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:56,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:56,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:56,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:56,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:56,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:56,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:56,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:56,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:56,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:56,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:56,902 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 01:22:56,916 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:56,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:56,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:56,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:56,918 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:56,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:56,918 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:56,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:56,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:56,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:56,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:56,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:56,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:56,919 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:56,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:56,920 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:56,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:56,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:56,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:56,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:56,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:56,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:56,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:56,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:56,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:56,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:56,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:56,922 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:56,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:22:57,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:57,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:57,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:57,222 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:57,222 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:57,223 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:57,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bedc74b8/985f96e11ae440f6aa44364e4434b7b7/FLAG1ca309efe [2019-10-15 01:22:57,867 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:57,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:57,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bedc74b8/985f96e11ae440f6aa44364e4434b7b7/FLAG1ca309efe [2019-10-15 01:22:58,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bedc74b8/985f96e11ae440f6aa44364e4434b7b7 [2019-10-15 01:22:58,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:58,198 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:58,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:58,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:58,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:58,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:58" (1/1) ... [2019-10-15 01:22:58,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ffb8e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58, skipping insertion in model container [2019-10-15 01:22:58,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:58" (1/1) ... [2019-10-15 01:22:58,220 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:58,281 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:58,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:58,661 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:58,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:58,785 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:58,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58 WrapperNode [2019-10-15 01:22:58,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:58,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:58,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:58,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:58,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58" (1/1) ... [2019-10-15 01:22:58,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58" (1/1) ... [2019-10-15 01:22:58,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58" (1/1) ... [2019-10-15 01:22:58,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58" (1/1) ... [2019-10-15 01:22:58,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58" (1/1) ... [2019-10-15 01:22:58,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58" (1/1) ... [2019-10-15 01:22:58,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58" (1/1) ... [2019-10-15 01:22:58,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:58,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:58,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:58,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:58,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58" (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 01:22:58,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:58,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:58,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:58,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:58,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:58,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:58,918 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:58,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:58,918 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:59,800 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:59,800 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:59,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:59 BoogieIcfgContainer [2019-10-15 01:22:59,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:59,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:59,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:59,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:59,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:58" (1/3) ... [2019-10-15 01:22:59,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b37547e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:59, skipping insertion in model container [2019-10-15 01:22:59,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:58" (2/3) ... [2019-10-15 01:22:59,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b37547e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:59, skipping insertion in model container [2019-10-15 01:22:59,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:59" (3/3) ... [2019-10-15 01:22:59,811 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:22:59,822 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:59,831 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:22:59,843 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:22:59,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:59,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:59,874 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:59,874 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:59,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:59,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:59,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:59,875 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-10-15 01:22:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:22:59,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:59,907 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 01:22:59,909 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash 273290580, now seen corresponding path program 1 times [2019-10-15 01:22:59,921 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:59,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144925638] [2019-10-15 01:22:59,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:00,387 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 01:23:00,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144925638] [2019-10-15 01:23:00,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:00,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:00,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495309362] [2019-10-15 01:23:00,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:00,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:00,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:00,415 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 6 states. [2019-10-15 01:23:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:00,881 INFO L93 Difference]: Finished difference Result 731 states and 1151 transitions. [2019-10-15 01:23:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:23:00,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-15 01:23:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:00,908 INFO L225 Difference]: With dead ends: 731 [2019-10-15 01:23:00,909 INFO L226 Difference]: Without dead ends: 632 [2019-10-15 01:23:00,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:23:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-15 01:23:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 425. [2019-10-15 01:23:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-15 01:23:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 641 transitions. [2019-10-15 01:23:01,013 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 641 transitions. Word has length 53 [2019-10-15 01:23:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:01,014 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 641 transitions. [2019-10-15 01:23:01,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 641 transitions. [2019-10-15 01:23:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:01,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:01,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:01,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1842914518, now seen corresponding path program 1 times [2019-10-15 01:23:01,018 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:01,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109374859] [2019-10-15 01:23:01,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:01,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109374859] [2019-10-15 01:23:01,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:01,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:01,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860030462] [2019-10-15 01:23:01,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:01,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:01,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:01,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:01,152 INFO L87 Difference]: Start difference. First operand 425 states and 641 transitions. Second operand 3 states. [2019-10-15 01:23:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:01,219 INFO L93 Difference]: Finished difference Result 1108 states and 1693 transitions. [2019-10-15 01:23:01,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:01,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-15 01:23:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:01,225 INFO L225 Difference]: With dead ends: 1108 [2019-10-15 01:23:01,225 INFO L226 Difference]: Without dead ends: 751 [2019-10-15 01:23:01,228 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 01:23:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-10-15 01:23:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 749. [2019-10-15 01:23:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-10-15 01:23:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1125 transitions. [2019-10-15 01:23:01,294 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1125 transitions. Word has length 56 [2019-10-15 01:23:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:01,296 INFO L462 AbstractCegarLoop]: Abstraction has 749 states and 1125 transitions. [2019-10-15 01:23:01,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1125 transitions. [2019-10-15 01:23:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:01,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:01,310 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:01,311 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:01,311 INFO L82 PathProgramCache]: Analyzing trace with hash -315457832, now seen corresponding path program 1 times [2019-10-15 01:23:01,311 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:01,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904458445] [2019-10-15 01:23:01,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:01,493 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 01:23:01,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904458445] [2019-10-15 01:23:01,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:01,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:01,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438762596] [2019-10-15 01:23:01,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:01,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:01,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:01,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:01,503 INFO L87 Difference]: Start difference. First operand 749 states and 1125 transitions. Second operand 3 states. [2019-10-15 01:23:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:01,647 INFO L93 Difference]: Finished difference Result 2012 states and 3038 transitions. [2019-10-15 01:23:01,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:01,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-15 01:23:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:01,655 INFO L225 Difference]: With dead ends: 2012 [2019-10-15 01:23:01,656 INFO L226 Difference]: Without dead ends: 1339 [2019-10-15 01:23:01,658 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 01:23:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-10-15 01:23:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-10-15 01:23:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-10-15 01:23:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1974 transitions. [2019-10-15 01:23:01,731 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1974 transitions. Word has length 56 [2019-10-15 01:23:01,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:01,731 INFO L462 AbstractCegarLoop]: Abstraction has 1337 states and 1974 transitions. [2019-10-15 01:23:01,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1974 transitions. [2019-10-15 01:23:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:01,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:01,734 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:01,734 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:01,734 INFO L82 PathProgramCache]: Analyzing trace with hash -622080838, now seen corresponding path program 1 times [2019-10-15 01:23:01,735 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:01,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779658410] [2019-10-15 01:23:01,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:01,927 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 01:23:01,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779658410] [2019-10-15 01:23:01,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:01,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:23:01,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063385181] [2019-10-15 01:23:01,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:23:01,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:23:01,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:23:01,929 INFO L87 Difference]: Start difference. First operand 1337 states and 1974 transitions. Second operand 10 states. [2019-10-15 01:23:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:03,750 INFO L93 Difference]: Finished difference Result 7876 states and 11683 transitions. [2019-10-15 01:23:03,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:23:03,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-10-15 01:23:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:03,796 INFO L225 Difference]: With dead ends: 7876 [2019-10-15 01:23:03,797 INFO L226 Difference]: Without dead ends: 7375 [2019-10-15 01:23:03,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:23:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7375 states. [2019-10-15 01:23:04,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7375 to 1362. [2019-10-15 01:23:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-10-15 01:23:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2006 transitions. [2019-10-15 01:23:04,086 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2006 transitions. Word has length 57 [2019-10-15 01:23:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:04,086 INFO L462 AbstractCegarLoop]: Abstraction has 1362 states and 2006 transitions. [2019-10-15 01:23:04,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:23:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2006 transitions. [2019-10-15 01:23:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:04,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:04,092 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:04,092 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:04,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash -993204644, now seen corresponding path program 1 times [2019-10-15 01:23:04,094 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:04,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766115231] [2019-10-15 01:23:04,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:04,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:04,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:04,420 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 01:23:04,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766115231] [2019-10-15 01:23:04,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:04,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:04,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200544727] [2019-10-15 01:23:04,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:04,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:04,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:04,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:04,426 INFO L87 Difference]: Start difference. First operand 1362 states and 2006 transitions. Second operand 9 states. [2019-10-15 01:23:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:06,682 INFO L93 Difference]: Finished difference Result 8646 states and 12825 transitions. [2019-10-15 01:23:06,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:23:06,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-15 01:23:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:06,720 INFO L225 Difference]: With dead ends: 8646 [2019-10-15 01:23:06,721 INFO L226 Difference]: Without dead ends: 7508 [2019-10-15 01:23:06,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-10-15 01:23:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2019-10-15 01:23:06,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 1401. [2019-10-15 01:23:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-10-15 01:23:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2057 transitions. [2019-10-15 01:23:06,921 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2057 transitions. Word has length 58 [2019-10-15 01:23:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:06,921 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 2057 transitions. [2019-10-15 01:23:06,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2057 transitions. [2019-10-15 01:23:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:06,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:06,923 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:06,924 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1499714113, now seen corresponding path program 1 times [2019-10-15 01:23:06,924 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:06,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900289573] [2019-10-15 01:23:06,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:06,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:06,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:07,045 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 01:23:07,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900289573] [2019-10-15 01:23:07,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:07,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:23:07,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321745507] [2019-10-15 01:23:07,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:23:07,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:07,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:23:07,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:07,048 INFO L87 Difference]: Start difference. First operand 1401 states and 2057 transitions. Second operand 7 states. [2019-10-15 01:23:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:08,194 INFO L93 Difference]: Finished difference Result 5866 states and 8795 transitions. [2019-10-15 01:23:08,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:23:08,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-15 01:23:08,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:08,223 INFO L225 Difference]: With dead ends: 5866 [2019-10-15 01:23:08,223 INFO L226 Difference]: Without dead ends: 5365 [2019-10-15 01:23:08,226 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 01:23:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2019-10-15 01:23:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 1382. [2019-10-15 01:23:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-10-15 01:23:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2033 transitions. [2019-10-15 01:23:08,413 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2033 transitions. Word has length 58 [2019-10-15 01:23:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:08,416 INFO L462 AbstractCegarLoop]: Abstraction has 1382 states and 2033 transitions. [2019-10-15 01:23:08,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:23:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2033 transitions. [2019-10-15 01:23:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:08,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:08,418 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:08,418 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:08,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1924616750, now seen corresponding path program 1 times [2019-10-15 01:23:08,420 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:08,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983481300] [2019-10-15 01:23:08,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:08,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:08,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:08,547 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 01:23:08,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983481300] [2019-10-15 01:23:08,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:08,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:23:08,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947182754] [2019-10-15 01:23:08,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:23:08,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:23:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:08,550 INFO L87 Difference]: Start difference. First operand 1382 states and 2033 transitions. Second operand 7 states. [2019-10-15 01:23:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:09,458 INFO L93 Difference]: Finished difference Result 5664 states and 8377 transitions. [2019-10-15 01:23:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:23:09,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-15 01:23:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:09,478 INFO L225 Difference]: With dead ends: 5664 [2019-10-15 01:23:09,478 INFO L226 Difference]: Without dead ends: 4526 [2019-10-15 01:23:09,483 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 01:23:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2019-10-15 01:23:09,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 1363. [2019-10-15 01:23:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-15 01:23:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2006 transitions. [2019-10-15 01:23:09,692 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2006 transitions. Word has length 59 [2019-10-15 01:23:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:09,692 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2006 transitions. [2019-10-15 01:23:09,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:23:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2006 transitions. [2019-10-15 01:23:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:09,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:09,694 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:09,694 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:09,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:09,695 INFO L82 PathProgramCache]: Analyzing trace with hash -157395530, now seen corresponding path program 1 times [2019-10-15 01:23:09,695 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:09,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722526277] [2019-10-15 01:23:09,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:09,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:09,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:09,817 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 01:23:09,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722526277] [2019-10-15 01:23:09,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:09,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:09,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802405999] [2019-10-15 01:23:09,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:09,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:09,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:09,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:09,819 INFO L87 Difference]: Start difference. First operand 1363 states and 2006 transitions. Second operand 9 states. [2019-10-15 01:23:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:11,219 INFO L93 Difference]: Finished difference Result 7072 states and 10472 transitions. [2019-10-15 01:23:11,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:23:11,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-15 01:23:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:11,233 INFO L225 Difference]: With dead ends: 7072 [2019-10-15 01:23:11,233 INFO L226 Difference]: Without dead ends: 5799 [2019-10-15 01:23:11,237 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 01:23:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5799 states. [2019-10-15 01:23:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5799 to 3842. [2019-10-15 01:23:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3842 states. [2019-10-15 01:23:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 5718 transitions. [2019-10-15 01:23:11,589 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 5718 transitions. Word has length 59 [2019-10-15 01:23:11,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:11,589 INFO L462 AbstractCegarLoop]: Abstraction has 3842 states and 5718 transitions. [2019-10-15 01:23:11,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 5718 transitions. [2019-10-15 01:23:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:11,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:11,592 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:11,592 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:11,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:11,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2127126793, now seen corresponding path program 1 times [2019-10-15 01:23:11,593 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:11,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577839698] [2019-10-15 01:23:11,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:11,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:11,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:11,706 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 01:23:11,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577839698] [2019-10-15 01:23:11,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:11,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:11,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382213835] [2019-10-15 01:23:11,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:11,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:11,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:11,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:11,710 INFO L87 Difference]: Start difference. First operand 3842 states and 5718 transitions. Second operand 9 states. [2019-10-15 01:23:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:14,239 INFO L93 Difference]: Finished difference Result 20312 states and 30202 transitions. [2019-10-15 01:23:14,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:23:14,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-15 01:23:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:14,280 INFO L225 Difference]: With dead ends: 20312 [2019-10-15 01:23:14,280 INFO L226 Difference]: Without dead ends: 16960 [2019-10-15 01:23:14,291 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 01:23:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16960 states. [2019-10-15 01:23:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16960 to 11727. [2019-10-15 01:23:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-10-15 01:23:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 17416 transitions. [2019-10-15 01:23:15,625 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 17416 transitions. Word has length 59 [2019-10-15 01:23:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:15,625 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 17416 transitions. [2019-10-15 01:23:15,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 17416 transitions. [2019-10-15 01:23:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:15,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:15,631 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:15,631 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:15,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1033600256, now seen corresponding path program 1 times [2019-10-15 01:23:15,633 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:15,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257079317] [2019-10-15 01:23:15,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:15,730 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 01:23:15,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257079317] [2019-10-15 01:23:15,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:15,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:15,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292907837] [2019-10-15 01:23:15,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:15,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:15,733 INFO L87 Difference]: Start difference. First operand 11727 states and 17416 transitions. Second operand 6 states. [2019-10-15 01:23:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:17,218 INFO L93 Difference]: Finished difference Result 23775 states and 35310 transitions. [2019-10-15 01:23:17,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:17,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-15 01:23:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:17,249 INFO L225 Difference]: With dead ends: 23775 [2019-10-15 01:23:17,249 INFO L226 Difference]: Without dead ends: 12940 [2019-10-15 01:23:17,271 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 01:23:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12940 states. [2019-10-15 01:23:18,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12940 to 8396. [2019-10-15 01:23:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8396 states. [2019-10-15 01:23:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 12355 transitions. [2019-10-15 01:23:18,326 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 12355 transitions. Word has length 60 [2019-10-15 01:23:18,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:18,327 INFO L462 AbstractCegarLoop]: Abstraction has 8396 states and 12355 transitions. [2019-10-15 01:23:18,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 12355 transitions. [2019-10-15 01:23:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:18,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:18,329 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:18,329 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:18,330 INFO L82 PathProgramCache]: Analyzing trace with hash -976844717, now seen corresponding path program 1 times [2019-10-15 01:23:18,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:18,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410560100] [2019-10-15 01:23:18,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:18,400 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 01:23:18,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410560100] [2019-10-15 01:23:18,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:18,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:18,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426970541] [2019-10-15 01:23:18,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:18,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:18,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:18,402 INFO L87 Difference]: Start difference. First operand 8396 states and 12355 transitions. Second operand 6 states. [2019-10-15 01:23:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:19,906 INFO L93 Difference]: Finished difference Result 20131 states and 29816 transitions. [2019-10-15 01:23:19,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:19,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-15 01:23:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:19,931 INFO L225 Difference]: With dead ends: 20131 [2019-10-15 01:23:19,931 INFO L226 Difference]: Without dead ends: 12331 [2019-10-15 01:23:19,949 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 01:23:19,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12331 states. [2019-10-15 01:23:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12331 to 7655. [2019-10-15 01:23:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-10-15 01:23:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11188 transitions. [2019-10-15 01:23:21,076 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11188 transitions. Word has length 60 [2019-10-15 01:23:21,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:21,077 INFO L462 AbstractCegarLoop]: Abstraction has 7655 states and 11188 transitions. [2019-10-15 01:23:21,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11188 transitions. [2019-10-15 01:23:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:21,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:21,079 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:21,079 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:21,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1274910523, now seen corresponding path program 1 times [2019-10-15 01:23:21,080 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:21,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014178737] [2019-10-15 01:23:21,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:21,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:21,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:21,138 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 01:23:21,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014178737] [2019-10-15 01:23:21,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:21,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:21,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532208548] [2019-10-15 01:23:21,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:21,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:21,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:21,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:21,141 INFO L87 Difference]: Start difference. First operand 7655 states and 11188 transitions. Second operand 5 states. [2019-10-15 01:23:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:22,635 INFO L93 Difference]: Finished difference Result 18506 states and 26953 transitions. [2019-10-15 01:23:22,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:22,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 01:23:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:22,654 INFO L225 Difference]: With dead ends: 18506 [2019-10-15 01:23:22,654 INFO L226 Difference]: Without dead ends: 10932 [2019-10-15 01:23:22,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10932 states. [2019-10-15 01:23:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10932 to 7655. [2019-10-15 01:23:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-10-15 01:23:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11084 transitions. [2019-10-15 01:23:24,230 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11084 transitions. Word has length 60 [2019-10-15 01:23:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:24,231 INFO L462 AbstractCegarLoop]: Abstraction has 7655 states and 11084 transitions. [2019-10-15 01:23:24,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11084 transitions. [2019-10-15 01:23:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 01:23:24,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:24,233 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:24,233 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:24,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:24,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1286220475, now seen corresponding path program 1 times [2019-10-15 01:23:24,233 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:24,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137893278] [2019-10-15 01:23:24,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:24,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:24,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:24,305 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 01:23:24,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137893278] [2019-10-15 01:23:24,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:24,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:24,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249587738] [2019-10-15 01:23:24,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:24,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:24,307 INFO L87 Difference]: Start difference. First operand 7655 states and 11084 transitions. Second operand 5 states. [2019-10-15 01:23:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:26,218 INFO L93 Difference]: Finished difference Result 19872 states and 28987 transitions. [2019-10-15 01:23:26,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:26,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-15 01:23:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:26,242 INFO L225 Difference]: With dead ends: 19872 [2019-10-15 01:23:26,243 INFO L226 Difference]: Without dead ends: 15928 [2019-10-15 01:23:26,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15928 states. [2019-10-15 01:23:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15928 to 9395. [2019-10-15 01:23:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9395 states. [2019-10-15 01:23:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9395 states to 9395 states and 13659 transitions. [2019-10-15 01:23:27,545 INFO L78 Accepts]: Start accepts. Automaton has 9395 states and 13659 transitions. Word has length 61 [2019-10-15 01:23:27,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:27,545 INFO L462 AbstractCegarLoop]: Abstraction has 9395 states and 13659 transitions. [2019-10-15 01:23:27,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 9395 states and 13659 transitions. [2019-10-15 01:23:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 01:23:27,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:27,547 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:27,548 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:27,548 INFO L82 PathProgramCache]: Analyzing trace with hash 740645981, now seen corresponding path program 1 times [2019-10-15 01:23:27,548 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:27,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892194489] [2019-10-15 01:23:27,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:27,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:27,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:27,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 01:23:27,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892194489] [2019-10-15 01:23:27,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:27,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:27,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644110447] [2019-10-15 01:23:27,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:27,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:27,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:27,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:27,616 INFO L87 Difference]: Start difference. First operand 9395 states and 13659 transitions. Second operand 5 states. [2019-10-15 01:23:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:29,727 INFO L93 Difference]: Finished difference Result 21359 states and 31168 transitions. [2019-10-15 01:23:29,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:29,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-15 01:23:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:29,746 INFO L225 Difference]: With dead ends: 21359 [2019-10-15 01:23:29,746 INFO L226 Difference]: Without dead ends: 17415 [2019-10-15 01:23:29,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2019-10-15 01:23:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 11338. [2019-10-15 01:23:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11338 states. [2019-10-15 01:23:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11338 states to 11338 states and 16529 transitions. [2019-10-15 01:23:31,138 INFO L78 Accepts]: Start accepts. Automaton has 11338 states and 16529 transitions. Word has length 61 [2019-10-15 01:23:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:31,138 INFO L462 AbstractCegarLoop]: Abstraction has 11338 states and 16529 transitions. [2019-10-15 01:23:31,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 11338 states and 16529 transitions. [2019-10-15 01:23:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-15 01:23:31,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:31,141 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:31,141 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:31,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1147863087, now seen corresponding path program 1 times [2019-10-15 01:23:31,142 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:31,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792070006] [2019-10-15 01:23:31,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:31,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:31,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:31,203 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 01:23:31,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792070006] [2019-10-15 01:23:31,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:31,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:31,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701515320] [2019-10-15 01:23:31,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:31,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:31,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:31,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:31,206 INFO L87 Difference]: Start difference. First operand 11338 states and 16529 transitions. Second operand 3 states. [2019-10-15 01:23:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:33,628 INFO L93 Difference]: Finished difference Result 27635 states and 40262 transitions. [2019-10-15 01:23:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:33,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-15 01:23:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:33,646 INFO L225 Difference]: With dead ends: 27635 [2019-10-15 01:23:33,647 INFO L226 Difference]: Without dead ends: 16793 [2019-10-15 01:23:33,661 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 01:23:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2019-10-15 01:23:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 13747. [2019-10-15 01:23:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13747 states. [2019-10-15 01:23:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13747 states to 13747 states and 19699 transitions. [2019-10-15 01:23:35,581 INFO L78 Accepts]: Start accepts. Automaton has 13747 states and 19699 transitions. Word has length 64 [2019-10-15 01:23:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:35,582 INFO L462 AbstractCegarLoop]: Abstraction has 13747 states and 19699 transitions. [2019-10-15 01:23:35,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 13747 states and 19699 transitions. [2019-10-15 01:23:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-15 01:23:35,585 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:35,586 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:35,586 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:35,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:35,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2093601519, now seen corresponding path program 1 times [2019-10-15 01:23:35,586 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:35,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882551868] [2019-10-15 01:23:35,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:35,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:35,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:35,670 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 01:23:35,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882551868] [2019-10-15 01:23:35,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:35,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:23:35,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585970854] [2019-10-15 01:23:35,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:23:35,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:35,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:23:35,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:35,676 INFO L87 Difference]: Start difference. First operand 13747 states and 19699 transitions. Second operand 7 states.