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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:34,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:34,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:34,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:34,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:34,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:34,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:34,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:34,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:34,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:34,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:34,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:34,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:34,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:34,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:34,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:34,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:34,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:34,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:34,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:34,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:34,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:34,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:34,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:34,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:34,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:34,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:34,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:34,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:34,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:34,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:34,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:34,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:34,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:34,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:34,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:34,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:34,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:34,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:34,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:34,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:34,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:23:34,644 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:34,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:34,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:34,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:34,649 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:34,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:34,649 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:34,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:34,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:34,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:34,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:34,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:34,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:34,651 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:34,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:34,651 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:34,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:34,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:34,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:34,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:34,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:34,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:34,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:34,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:34,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:34,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:34,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:34,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:34,655 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-13 21:23:34,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:34,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:34,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:34,932 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:34,932 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:34,933 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:23:34,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f87087e/196a29a1c28f4b598816363d746e0b1b/FLAG79f8e5f32 [2019-10-13 21:23:35,532 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:35,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:23:35,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f87087e/196a29a1c28f4b598816363d746e0b1b/FLAG79f8e5f32 [2019-10-13 21:23:35,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f87087e/196a29a1c28f4b598816363d746e0b1b [2019-10-13 21:23:35,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:35,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:35,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:35,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:35,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:35,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:35" (1/1) ... [2019-10-13 21:23:35,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d271b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:35, skipping insertion in model container [2019-10-13 21:23:35,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:35" (1/1) ... [2019-10-13 21:23:35,844 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:35,925 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:36,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:36,570 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:37,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:37,035 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:37,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37 WrapperNode [2019-10-13 21:23:37,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:37,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:37,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:37,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:37,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:37,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:37,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:37,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:37,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:37,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:37,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:37,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:37,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:37,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:37,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:37,234 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:37,235 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:37,235 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:37,235 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:37,235 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:37,236 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:37,236 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:37,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:37,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:38,822 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:38,824 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:38,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:38 BoogieIcfgContainer [2019-10-13 21:23:38,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:38,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:38,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:38,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:38,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:35" (1/3) ... [2019-10-13 21:23:38,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6191f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:38, skipping insertion in model container [2019-10-13 21:23:38,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (2/3) ... [2019-10-13 21:23:38,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6191f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:38, skipping insertion in model container [2019-10-13 21:23:38,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:38" (3/3) ... [2019-10-13 21:23:38,838 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:23:38,849 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:38,872 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 21:23:38,887 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 21:23:38,924 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:38,925 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:38,925 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:38,925 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:38,925 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:38,926 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:38,926 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:38,926 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states. [2019-10-13 21:23:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:23:38,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:38,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:38,976 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1111774015, now seen corresponding path program 1 times [2019-10-13 21:23:38,991 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:38,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147535219] [2019-10-13 21:23:38,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:39,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147535219] [2019-10-13 21:23:39,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:39,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:39,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374608968] [2019-10-13 21:23:39,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:39,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:39,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:39,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:39,877 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 4 states. [2019-10-13 21:23:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:40,151 INFO L93 Difference]: Finished difference Result 1107 states and 1990 transitions. [2019-10-13 21:23:40,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:23:40,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-10-13 21:23:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:40,180 INFO L225 Difference]: With dead ends: 1107 [2019-10-13 21:23:40,180 INFO L226 Difference]: Without dead ends: 730 [2019-10-13 21:23:40,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-13 21:23:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 705. [2019-10-13 21:23:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-10-13 21:23:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1008 transitions. [2019-10-13 21:23:40,322 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1008 transitions. Word has length 143 [2019-10-13 21:23:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:40,323 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1008 transitions. [2019-10-13 21:23:40,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1008 transitions. [2019-10-13 21:23:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:23:40,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:40,336 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:40,336 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 25365273, now seen corresponding path program 1 times [2019-10-13 21:23:40,337 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:40,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256769676] [2019-10-13 21:23:40,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:40,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256769676] [2019-10-13 21:23:40,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:40,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:40,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907578707] [2019-10-13 21:23:40,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:40,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:40,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:40,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:40,434 INFO L87 Difference]: Start difference. First operand 705 states and 1008 transitions. Second operand 3 states. [2019-10-13 21:23:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:40,526 INFO L93 Difference]: Finished difference Result 2069 states and 2954 transitions. [2019-10-13 21:23:40,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:40,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-13 21:23:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:40,535 INFO L225 Difference]: With dead ends: 2069 [2019-10-13 21:23:40,536 INFO L226 Difference]: Without dead ends: 1396 [2019-10-13 21:23:40,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-10-13 21:23:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 707. [2019-10-13 21:23:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-10-13 21:23:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1010 transitions. [2019-10-13 21:23:40,593 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1010 transitions. Word has length 144 [2019-10-13 21:23:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:40,595 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1010 transitions. [2019-10-13 21:23:40,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1010 transitions. [2019-10-13 21:23:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:23:40,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:40,599 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:40,600 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:40,600 INFO L82 PathProgramCache]: Analyzing trace with hash 166703234, now seen corresponding path program 1 times [2019-10-13 21:23:40,601 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:40,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624958693] [2019-10-13 21:23:40,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:40,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624958693] [2019-10-13 21:23:40,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:40,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:40,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547274904] [2019-10-13 21:23:40,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:40,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:40,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:40,806 INFO L87 Difference]: Start difference. First operand 707 states and 1010 transitions. Second operand 3 states. [2019-10-13 21:23:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:40,920 INFO L93 Difference]: Finished difference Result 1893 states and 2715 transitions. [2019-10-13 21:23:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:40,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-10-13 21:23:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:40,930 INFO L225 Difference]: With dead ends: 1893 [2019-10-13 21:23:40,930 INFO L226 Difference]: Without dead ends: 1368 [2019-10-13 21:23:40,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-10-13 21:23:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1343. [2019-10-13 21:23:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-10-13 21:23:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1911 transitions. [2019-10-13 21:23:40,998 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1911 transitions. Word has length 145 [2019-10-13 21:23:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:40,998 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1911 transitions. [2019-10-13 21:23:40,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1911 transitions. [2019-10-13 21:23:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:23:41,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:41,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:41,003 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:41,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:41,004 INFO L82 PathProgramCache]: Analyzing trace with hash 271175045, now seen corresponding path program 1 times [2019-10-13 21:23:41,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:41,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495076933] [2019-10-13 21:23:41,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:41,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495076933] [2019-10-13 21:23:41,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:41,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:41,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017991174] [2019-10-13 21:23:41,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:41,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:41,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:41,361 INFO L87 Difference]: Start difference. First operand 1343 states and 1911 transitions. Second operand 4 states. [2019-10-13 21:23:41,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:41,456 INFO L93 Difference]: Finished difference Result 2201 states and 3141 transitions. [2019-10-13 21:23:41,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:41,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-13 21:23:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:41,465 INFO L225 Difference]: With dead ends: 2201 [2019-10-13 21:23:41,465 INFO L226 Difference]: Without dead ends: 1030 [2019-10-13 21:23:41,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-10-13 21:23:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2019-10-13 21:23:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2019-10-13 21:23:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1457 transitions. [2019-10-13 21:23:41,522 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1457 transitions. Word has length 145 [2019-10-13 21:23:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:41,522 INFO L462 AbstractCegarLoop]: Abstraction has 1030 states and 1457 transitions. [2019-10-13 21:23:41,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1457 transitions. [2019-10-13 21:23:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:23:41,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:41,526 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:41,527 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1646821595, now seen corresponding path program 1 times [2019-10-13 21:23:41,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:41,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330721949] [2019-10-13 21:23:41,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:41,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330721949] [2019-10-13 21:23:41,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:41,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:23:41,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624642806] [2019-10-13 21:23:41,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:23:41,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:41,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:23:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:23:41,903 INFO L87 Difference]: Start difference. First operand 1030 states and 1457 transitions. Second operand 9 states. [2019-10-13 21:23:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:42,860 INFO L93 Difference]: Finished difference Result 2677 states and 3904 transitions. [2019-10-13 21:23:42,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:23:42,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-10-13 21:23:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:42,870 INFO L225 Difference]: With dead ends: 2677 [2019-10-13 21:23:42,870 INFO L226 Difference]: Without dead ends: 1818 [2019-10-13 21:23:42,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:23:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2019-10-13 21:23:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1496. [2019-10-13 21:23:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-10-13 21:23:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2138 transitions. [2019-10-13 21:23:42,965 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2138 transitions. Word has length 151 [2019-10-13 21:23:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:42,967 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2138 transitions. [2019-10-13 21:23:42,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:23:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2138 transitions. [2019-10-13 21:23:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:23:42,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:42,971 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:42,971 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash 154501339, now seen corresponding path program 1 times [2019-10-13 21:23:42,972 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:42,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488116214] [2019-10-13 21:23:42,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:43,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488116214] [2019-10-13 21:23:43,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:43,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:43,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893887745] [2019-10-13 21:23:43,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:43,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:43,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:43,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:43,204 INFO L87 Difference]: Start difference. First operand 1496 states and 2138 transitions. Second operand 4 states. [2019-10-13 21:23:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:43,500 INFO L93 Difference]: Finished difference Result 2950 states and 4367 transitions. [2019-10-13 21:23:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:43,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-13 21:23:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:43,522 INFO L225 Difference]: With dead ends: 2950 [2019-10-13 21:23:43,522 INFO L226 Difference]: Without dead ends: 2430 [2019-10-13 21:23:43,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2019-10-13 21:23:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2428. [2019-10-13 21:23:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2019-10-13 21:23:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3512 transitions. [2019-10-13 21:23:43,681 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3512 transitions. Word has length 151 [2019-10-13 21:23:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:43,684 INFO L462 AbstractCegarLoop]: Abstraction has 2428 states and 3512 transitions. [2019-10-13 21:23:43,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3512 transitions. [2019-10-13 21:23:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:23:43,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:43,689 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:43,690 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2031358202, now seen corresponding path program 1 times [2019-10-13 21:23:43,690 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:43,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774444957] [2019-10-13 21:23:43,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:43,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:43,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:43,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774444957] [2019-10-13 21:23:43,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:43,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:43,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429375438] [2019-10-13 21:23:43,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:43,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:43,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:43,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:43,963 INFO L87 Difference]: Start difference. First operand 2428 states and 3512 transitions. Second operand 4 states. [2019-10-13 21:23:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:44,270 INFO L93 Difference]: Finished difference Result 6277 states and 9070 transitions. [2019-10-13 21:23:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:44,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-13 21:23:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:44,289 INFO L225 Difference]: With dead ends: 6277 [2019-10-13 21:23:44,289 INFO L226 Difference]: Without dead ends: 3872 [2019-10-13 21:23:44,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2019-10-13 21:23:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3850. [2019-10-13 21:23:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3850 states. [2019-10-13 21:23:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 5507 transitions. [2019-10-13 21:23:44,560 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 5507 transitions. Word has length 151 [2019-10-13 21:23:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:44,560 INFO L462 AbstractCegarLoop]: Abstraction has 3850 states and 5507 transitions. [2019-10-13 21:23:44,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 5507 transitions. [2019-10-13 21:23:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:23:44,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:44,568 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:44,569 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:44,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:44,569 INFO L82 PathProgramCache]: Analyzing trace with hash 30760331, now seen corresponding path program 1 times [2019-10-13 21:23:44,569 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:44,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409755685] [2019-10-13 21:23:44,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:44,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:44,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:44,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409755685] [2019-10-13 21:23:44,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:44,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:44,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514007414] [2019-10-13 21:23:44,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:44,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:44,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:44,760 INFO L87 Difference]: Start difference. First operand 3850 states and 5507 transitions. Second operand 3 states. [2019-10-13 21:23:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:45,148 INFO L93 Difference]: Finished difference Result 10830 states and 15529 transitions. [2019-10-13 21:23:45,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:45,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-13 21:23:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:45,182 INFO L225 Difference]: With dead ends: 10830 [2019-10-13 21:23:45,183 INFO L226 Difference]: Without dead ends: 7331 [2019-10-13 21:23:45,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:45,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2019-10-13 21:23:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 7311. [2019-10-13 21:23:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7311 states. [2019-10-13 21:23:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7311 states to 7311 states and 10356 transitions. [2019-10-13 21:23:45,678 INFO L78 Accepts]: Start accepts. Automaton has 7311 states and 10356 transitions. Word has length 153 [2019-10-13 21:23:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:45,678 INFO L462 AbstractCegarLoop]: Abstraction has 7311 states and 10356 transitions. [2019-10-13 21:23:45,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 7311 states and 10356 transitions. [2019-10-13 21:23:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:23:45,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:45,690 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:45,690 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:45,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:45,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1476891570, now seen corresponding path program 1 times [2019-10-13 21:23:45,691 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:45,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115398063] [2019-10-13 21:23:45,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:45,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:45,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:45,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115398063] [2019-10-13 21:23:45,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:45,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:45,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087943064] [2019-10-13 21:23:45,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:45,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:45,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:45,848 INFO L87 Difference]: Start difference. First operand 7311 states and 10356 transitions. Second operand 4 states. [2019-10-13 21:23:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:46,225 INFO L93 Difference]: Finished difference Result 11608 states and 16445 transitions. [2019-10-13 21:23:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:46,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-13 21:23:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:46,252 INFO L225 Difference]: With dead ends: 11608 [2019-10-13 21:23:46,253 INFO L226 Difference]: Without dead ends: 5961 [2019-10-13 21:23:46,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2019-10-13 21:23:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 5961. [2019-10-13 21:23:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5961 states. [2019-10-13 21:23:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 8411 transitions. [2019-10-13 21:23:46,600 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 8411 transitions. Word has length 153 [2019-10-13 21:23:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:46,601 INFO L462 AbstractCegarLoop]: Abstraction has 5961 states and 8411 transitions. [2019-10-13 21:23:46,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 8411 transitions. [2019-10-13 21:23:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:23:46,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:46,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:46,611 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash 770800706, now seen corresponding path program 1 times [2019-10-13 21:23:46,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:46,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992855207] [2019-10-13 21:23:46,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:46,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:46,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:46,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992855207] [2019-10-13 21:23:46,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:46,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:23:46,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438899459] [2019-10-13 21:23:46,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:23:46,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:46,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:23:46,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:23:46,843 INFO L87 Difference]: Start difference. First operand 5961 states and 8411 transitions. Second operand 8 states. [2019-10-13 21:23:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:48,381 INFO L93 Difference]: Finished difference Result 20223 states and 30063 transitions. [2019-10-13 21:23:48,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:23:48,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-10-13 21:23:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:48,419 INFO L225 Difference]: With dead ends: 20223 [2019-10-13 21:23:48,419 INFO L226 Difference]: Without dead ends: 17597 [2019-10-13 21:23:48,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:23:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17597 states. [2019-10-13 21:23:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17597 to 16970. [2019-10-13 21:23:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16970 states. [2019-10-13 21:23:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16970 states to 16970 states and 24854 transitions. [2019-10-13 21:23:49,375 INFO L78 Accepts]: Start accepts. Automaton has 16970 states and 24854 transitions. Word has length 159 [2019-10-13 21:23:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:49,375 INFO L462 AbstractCegarLoop]: Abstraction has 16970 states and 24854 transitions. [2019-10-13 21:23:49,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:23:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 16970 states and 24854 transitions. [2019-10-13 21:23:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:23:49,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:49,394 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:49,394 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1027311707, now seen corresponding path program 1 times [2019-10-13 21:23:49,395 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:49,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829459691] [2019-10-13 21:23:49,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:49,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:49,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:49,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829459691] [2019-10-13 21:23:49,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:49,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:49,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219153060] [2019-10-13 21:23:49,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:49,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:49,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:49,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:49,621 INFO L87 Difference]: Start difference. First operand 16970 states and 24854 transitions. Second operand 4 states. [2019-10-13 21:23:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:51,427 INFO L93 Difference]: Finished difference Result 49667 states and 72598 transitions. [2019-10-13 21:23:51,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:51,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-13 21:23:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:51,503 INFO L225 Difference]: With dead ends: 49667 [2019-10-13 21:23:51,503 INFO L226 Difference]: Without dead ends: 32740 [2019-10-13 21:23:51,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32740 states. [2019-10-13 21:23:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32740 to 32684. [2019-10-13 21:23:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-10-13 21:23:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 47291 transitions. [2019-10-13 21:23:53,551 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 47291 transitions. Word has length 159 [2019-10-13 21:23:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:53,551 INFO L462 AbstractCegarLoop]: Abstraction has 32684 states and 47291 transitions. [2019-10-13 21:23:53,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 47291 transitions. [2019-10-13 21:23:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 21:23:53,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:53,576 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:53,577 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:53,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:53,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1202093437, now seen corresponding path program 1 times [2019-10-13 21:23:53,577 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:53,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912810501] [2019-10-13 21:23:53,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:53,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:53,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912810501] [2019-10-13 21:23:53,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:53,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:53,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959762447] [2019-10-13 21:23:53,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:53,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:53,638 INFO L87 Difference]: Start difference. First operand 32684 states and 47291 transitions. Second operand 3 states. [2019-10-13 21:23:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:56,674 INFO L93 Difference]: Finished difference Result 97858 states and 141624 transitions. [2019-10-13 21:23:56,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:56,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-13 21:23:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:56,801 INFO L225 Difference]: With dead ends: 97858 [2019-10-13 21:23:56,801 INFO L226 Difference]: Without dead ends: 65280 [2019-10-13 21:23:56,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65280 states. [2019-10-13 21:23:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65280 to 32690. [2019-10-13 21:23:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32690 states. [2019-10-13 21:23:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32690 states to 32690 states and 47297 transitions. [2019-10-13 21:23:58,613 INFO L78 Accepts]: Start accepts. Automaton has 32690 states and 47297 transitions. Word has length 160 [2019-10-13 21:23:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:58,613 INFO L462 AbstractCegarLoop]: Abstraction has 32690 states and 47297 transitions. [2019-10-13 21:23:58,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 32690 states and 47297 transitions. [2019-10-13 21:23:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:23:58,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:58,638 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:58,638 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:58,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1346353852, now seen corresponding path program 1 times [2019-10-13 21:23:58,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:58,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721432098] [2019-10-13 21:23:58,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:58,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:58,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:58,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721432098] [2019-10-13 21:23:58,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:58,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:58,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491557052] [2019-10-13 21:23:58,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:58,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:58,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:58,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:58,946 INFO L87 Difference]: Start difference. First operand 32690 states and 47297 transitions. Second operand 4 states. [2019-10-13 21:24:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:00,162 INFO L93 Difference]: Finished difference Result 65338 states and 94538 transitions. [2019-10-13 21:24:00,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:00,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-13 21:24:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:00,214 INFO L225 Difference]: With dead ends: 65338 [2019-10-13 21:24:00,214 INFO L226 Difference]: Without dead ends: 32684 [2019-10-13 21:24:00,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32684 states. [2019-10-13 21:24:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32684 to 32684. [2019-10-13 21:24:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-10-13 21:24:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 47285 transitions. [2019-10-13 21:24:02,705 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 47285 transitions. Word has length 161 [2019-10-13 21:24:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:02,705 INFO L462 AbstractCegarLoop]: Abstraction has 32684 states and 47285 transitions. [2019-10-13 21:24:02,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 47285 transitions. [2019-10-13 21:24:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:24:02,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:02,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:02,724 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash 913057412, now seen corresponding path program 1 times [2019-10-13 21:24:02,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:02,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564809935] [2019-10-13 21:24:02,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:02,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564809935] [2019-10-13 21:24:02,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:02,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:02,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750703486] [2019-10-13 21:24:02,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:02,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:02,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:02,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:02,834 INFO L87 Difference]: Start difference. First operand 32684 states and 47285 transitions. Second operand 3 states. [2019-10-13 21:24:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:04,889 INFO L93 Difference]: Finished difference Result 80670 states and 116554 transitions. [2019-10-13 21:24:04,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:04,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-13 21:24:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:04,963 INFO L225 Difference]: With dead ends: 80670 [2019-10-13 21:24:04,963 INFO L226 Difference]: Without dead ends: 48670 [2019-10-13 21:24:05,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48670 states. [2019-10-13 21:24:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48670 to 48614. [2019-10-13 21:24:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48614 states. [2019-10-13 21:24:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48614 states to 48614 states and 69220 transitions. [2019-10-13 21:24:08,686 INFO L78 Accepts]: Start accepts. Automaton has 48614 states and 69220 transitions. Word has length 161 [2019-10-13 21:24:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:08,686 INFO L462 AbstractCegarLoop]: Abstraction has 48614 states and 69220 transitions. [2019-10-13 21:24:08,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 48614 states and 69220 transitions. [2019-10-13 21:24:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-13 21:24:08,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:08,707 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:08,707 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash -607664097, now seen corresponding path program 1 times [2019-10-13 21:24:08,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:08,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733212126] [2019-10-13 21:24:08,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:08,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:08,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:09,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733212126] [2019-10-13 21:24:09,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:09,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-13 21:24:09,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412801958] [2019-10-13 21:24:09,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 21:24:09,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:09,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 21:24:09,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:24:09,104 INFO L87 Difference]: Start difference. First operand 48614 states and 69220 transitions. Second operand 15 states.