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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:32,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:32,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:32,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:32,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:32,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:32,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:32,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:32,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:32,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:32,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:32,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:32,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:32,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:32,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:32,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:32,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:32,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:32,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:32,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:32,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:32,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:32,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:32,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:32,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:32,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:32,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:32,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:32,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:32,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:32,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:32,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:32,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:32,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:32,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:32,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:32,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:32,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:32,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:32,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:32,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:32,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:23:32,447 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:32,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:32,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:32,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:32,450 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:32,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:32,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:32,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:32,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:32,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:32,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:32,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:32,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:32,452 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:32,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:32,453 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:32,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:32,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:32,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:32,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:32,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:32,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:32,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:32,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:32,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:32,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:32,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:32,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:32,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:23:32,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:32,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:32,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:32,747 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:32,747 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:32,748 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:23:32,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9cf8a3bd/29f2bbc349b04b0c99254c86c754b40a/FLAG85e79bca5 [2019-10-15 01:23:33,374 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:33,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:23:33,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9cf8a3bd/29f2bbc349b04b0c99254c86c754b40a/FLAG85e79bca5 [2019-10-15 01:23:33,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9cf8a3bd/29f2bbc349b04b0c99254c86c754b40a [2019-10-15 01:23:33,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:33,731 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:33,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:33,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:33,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:33,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:33" (1/1) ... [2019-10-15 01:23:33,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c12d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:33, skipping insertion in model container [2019-10-15 01:23:33,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:33" (1/1) ... [2019-10-15 01:23:33,748 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:33,811 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:34,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:34,294 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:34,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:34,455 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:34,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:34 WrapperNode [2019-10-15 01:23:34,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:34,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:34,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:34,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:34,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:34" (1/1) ... [2019-10-15 01:23:34,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:34" (1/1) ... [2019-10-15 01:23:34,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:34" (1/1) ... [2019-10-15 01:23:34,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:34" (1/1) ... [2019-10-15 01:23:34,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:34" (1/1) ... [2019-10-15 01:23:34,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:34" (1/1) ... [2019-10-15 01:23:34,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:34" (1/1) ... [2019-10-15 01:23:34,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:34,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:34,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:34,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:34,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:34,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:34,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:34,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:34,612 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:35,885 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:35,886 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:35,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:35 BoogieIcfgContainer [2019-10-15 01:23:35,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:35,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:35,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:35,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:35,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:33" (1/3) ... [2019-10-15 01:23:35,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7a1f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:35, skipping insertion in model container [2019-10-15 01:23:35,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:34" (2/3) ... [2019-10-15 01:23:35,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7a1f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:35, skipping insertion in model container [2019-10-15 01:23:35,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:35" (3/3) ... [2019-10-15 01:23:35,899 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-15 01:23:35,913 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:35,922 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:23:35,935 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:23:35,966 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:35,966 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:35,966 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:35,967 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:35,967 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:35,967 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:35,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:35,968 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2019-10-15 01:23:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:23:36,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:36,032 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] [2019-10-15 01:23:36,034 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:36,039 INFO L82 PathProgramCache]: Analyzing trace with hash -766456376, now seen corresponding path program 1 times [2019-10-15 01:23:36,047 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:36,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867090929] [2019-10-15 01:23:36,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:36,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:36,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:36,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867090929] [2019-10-15 01:23:36,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:36,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:36,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905163328] [2019-10-15 01:23:36,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:36,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:36,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:36,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:36,685 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 3 states. [2019-10-15 01:23:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:36,877 INFO L93 Difference]: Finished difference Result 489 states and 838 transitions. [2019-10-15 01:23:36,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:36,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-15 01:23:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:36,898 INFO L225 Difference]: With dead ends: 489 [2019-10-15 01:23:36,898 INFO L226 Difference]: Without dead ends: 362 [2019-10-15 01:23:36,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-15 01:23:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-10-15 01:23:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-15 01:23:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-10-15 01:23:37,000 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 104 [2019-10-15 01:23:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:37,004 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-10-15 01:23:37,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-10-15 01:23:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:23:37,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:37,011 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] [2019-10-15 01:23:37,013 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:37,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1314271708, now seen corresponding path program 1 times [2019-10-15 01:23:37,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:37,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352200645] [2019-10-15 01:23:37,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:37,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:37,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:37,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352200645] [2019-10-15 01:23:37,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:37,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:37,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027209452] [2019-10-15 01:23:37,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:37,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:37,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:37,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:37,508 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 4 states. [2019-10-15 01:23:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:37,659 INFO L93 Difference]: Finished difference Result 1038 states and 1576 transitions. [2019-10-15 01:23:37,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:37,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-15 01:23:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:37,665 INFO L225 Difference]: With dead ends: 1038 [2019-10-15 01:23:37,666 INFO L226 Difference]: Without dead ends: 691 [2019-10-15 01:23:37,669 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-15 01:23:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-15 01:23:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2019-10-15 01:23:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-10-15 01:23:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1038 transitions. [2019-10-15 01:23:37,737 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1038 transitions. Word has length 104 [2019-10-15 01:23:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:37,740 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1038 transitions. [2019-10-15 01:23:37,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1038 transitions. [2019-10-15 01:23:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:23:37,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:37,753 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] [2019-10-15 01:23:37,753 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:37,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2074994812, now seen corresponding path program 1 times [2019-10-15 01:23:37,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:37,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137055360] [2019-10-15 01:23:37,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:37,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:37,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:37,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137055360] [2019-10-15 01:23:37,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:37,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:37,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681129350] [2019-10-15 01:23:37,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:37,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:37,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:37,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:37,866 INFO L87 Difference]: Start difference. First operand 689 states and 1038 transitions. Second operand 3 states. [2019-10-15 01:23:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:37,947 INFO L93 Difference]: Finished difference Result 2021 states and 3044 transitions. [2019-10-15 01:23:37,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:37,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-15 01:23:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:37,957 INFO L225 Difference]: With dead ends: 2021 [2019-10-15 01:23:37,957 INFO L226 Difference]: Without dead ends: 1364 [2019-10-15 01:23:37,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-10-15 01:23:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 691. [2019-10-15 01:23:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-10-15 01:23:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1040 transitions. [2019-10-15 01:23:38,015 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1040 transitions. Word has length 105 [2019-10-15 01:23:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:38,015 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1040 transitions. [2019-10-15 01:23:38,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1040 transitions. [2019-10-15 01:23:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:23:38,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:38,022 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] [2019-10-15 01:23:38,022 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:38,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1322406660, now seen corresponding path program 1 times [2019-10-15 01:23:38,023 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:38,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393277790] [2019-10-15 01:23:38,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:38,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393277790] [2019-10-15 01:23:38,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:38,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:38,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174687611] [2019-10-15 01:23:38,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:38,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:38,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:38,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:38,153 INFO L87 Difference]: Start difference. First operand 691 states and 1040 transitions. Second operand 3 states. [2019-10-15 01:23:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:38,259 INFO L93 Difference]: Finished difference Result 1822 states and 2765 transitions. [2019-10-15 01:23:38,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:38,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-15 01:23:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:38,267 INFO L225 Difference]: With dead ends: 1822 [2019-10-15 01:23:38,267 INFO L226 Difference]: Without dead ends: 1330 [2019-10-15 01:23:38,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-10-15 01:23:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2019-10-15 01:23:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-10-15 01:23:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1983 transitions. [2019-10-15 01:23:38,346 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1983 transitions. Word has length 106 [2019-10-15 01:23:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:38,347 INFO L462 AbstractCegarLoop]: Abstraction has 1328 states and 1983 transitions. [2019-10-15 01:23:38,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1983 transitions. [2019-10-15 01:23:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:23:38,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:38,350 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] [2019-10-15 01:23:38,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:38,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1537198239, now seen corresponding path program 1 times [2019-10-15 01:23:38,351 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:38,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063159024] [2019-10-15 01:23:38,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,352 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:38,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063159024] [2019-10-15 01:23:38,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:38,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:38,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529622632] [2019-10-15 01:23:38,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:38,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:38,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:38,534 INFO L87 Difference]: Start difference. First operand 1328 states and 1983 transitions. Second operand 4 states. [2019-10-15 01:23:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:38,661 INFO L93 Difference]: Finished difference Result 2157 states and 3243 transitions. [2019-10-15 01:23:38,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:38,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-15 01:23:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:38,668 INFO L225 Difference]: With dead ends: 2157 [2019-10-15 01:23:38,668 INFO L226 Difference]: Without dead ends: 1016 [2019-10-15 01:23:38,671 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-15 01:23:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-10-15 01:23:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2019-10-15 01:23:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-10-15 01:23:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1511 transitions. [2019-10-15 01:23:38,736 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1511 transitions. Word has length 106 [2019-10-15 01:23:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:38,737 INFO L462 AbstractCegarLoop]: Abstraction has 1016 states and 1511 transitions. [2019-10-15 01:23:38,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1511 transitions. [2019-10-15 01:23:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:23:38,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:38,740 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] [2019-10-15 01:23:38,740 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:38,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1464646849, now seen corresponding path program 1 times [2019-10-15 01:23:38,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:38,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075102963] [2019-10-15 01:23:38,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:38,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075102963] [2019-10-15 01:23:38,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:38,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:38,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883264332] [2019-10-15 01:23:38,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:38,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:38,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:38,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:38,870 INFO L87 Difference]: Start difference. First operand 1016 states and 1511 transitions. Second operand 3 states. [2019-10-15 01:23:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:38,988 INFO L93 Difference]: Finished difference Result 2291 states and 3531 transitions. [2019-10-15 01:23:38,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:38,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-15 01:23:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:39,000 INFO L225 Difference]: With dead ends: 2291 [2019-10-15 01:23:39,000 INFO L226 Difference]: Without dead ends: 1464 [2019-10-15 01:23:39,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-10-15 01:23:39,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1432. [2019-10-15 01:23:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-10-15 01:23:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2190 transitions. [2019-10-15 01:23:39,100 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2190 transitions. Word has length 106 [2019-10-15 01:23:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:39,100 INFO L462 AbstractCegarLoop]: Abstraction has 1432 states and 2190 transitions. [2019-10-15 01:23:39,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2190 transitions. [2019-10-15 01:23:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 01:23:39,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:39,103 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] [2019-10-15 01:23:39,103 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:39,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:39,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1043553758, now seen corresponding path program 1 times [2019-10-15 01:23:39,104 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:39,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725258704] [2019-10-15 01:23:39,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:39,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:39,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:39,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725258704] [2019-10-15 01:23:39,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:39,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:39,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125842305] [2019-10-15 01:23:39,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:39,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:39,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:39,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:39,195 INFO L87 Difference]: Start difference. First operand 1432 states and 2190 transitions. Second operand 3 states. [2019-10-15 01:23:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:39,344 INFO L93 Difference]: Finished difference Result 3397 states and 5357 transitions. [2019-10-15 01:23:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:39,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-10-15 01:23:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:39,357 INFO L225 Difference]: With dead ends: 3397 [2019-10-15 01:23:39,358 INFO L226 Difference]: Without dead ends: 2238 [2019-10-15 01:23:39,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2019-10-15 01:23:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2176. [2019-10-15 01:23:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-10-15 01:23:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3396 transitions. [2019-10-15 01:23:39,523 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3396 transitions. Word has length 108 [2019-10-15 01:23:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:39,524 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3396 transitions. [2019-10-15 01:23:39,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3396 transitions. [2019-10-15 01:23:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:23:39,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:39,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] [2019-10-15 01:23:39,526 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1020043605, now seen corresponding path program 1 times [2019-10-15 01:23:39,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:39,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229601049] [2019-10-15 01:23:39,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:39,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:39,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:39,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229601049] [2019-10-15 01:23:39,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:39,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:39,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139003854] [2019-10-15 01:23:39,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:39,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:39,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:39,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:39,664 INFO L87 Difference]: Start difference. First operand 2176 states and 3396 transitions. Second operand 5 states. [2019-10-15 01:23:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:40,171 INFO L93 Difference]: Finished difference Result 4171 states and 6562 transitions. [2019-10-15 01:23:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:40,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-15 01:23:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:40,188 INFO L225 Difference]: With dead ends: 4171 [2019-10-15 01:23:40,188 INFO L226 Difference]: Without dead ends: 2178 [2019-10-15 01:23:40,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-10-15 01:23:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2176. [2019-10-15 01:23:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-10-15 01:23:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3381 transitions. [2019-10-15 01:23:40,423 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3381 transitions. Word has length 109 [2019-10-15 01:23:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:40,424 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3381 transitions. [2019-10-15 01:23:40,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3381 transitions. [2019-10-15 01:23:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:23:40,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:40,426 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] [2019-10-15 01:23:40,426 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash 802679046, now seen corresponding path program 1 times [2019-10-15 01:23:40,427 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:40,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596876977] [2019-10-15 01:23:40,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:40,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:40,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:40,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596876977] [2019-10-15 01:23:40,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:40,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:40,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573540042] [2019-10-15 01:23:40,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:40,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:40,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:40,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:40,647 INFO L87 Difference]: Start difference. First operand 2176 states and 3381 transitions. Second operand 4 states. [2019-10-15 01:23:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:40,902 INFO L93 Difference]: Finished difference Result 5611 states and 8738 transitions. [2019-10-15 01:23:40,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:40,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-15 01:23:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:40,922 INFO L225 Difference]: With dead ends: 5611 [2019-10-15 01:23:40,922 INFO L226 Difference]: Without dead ends: 3458 [2019-10-15 01:23:40,930 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-15 01:23:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-10-15 01:23:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3456. [2019-10-15 01:23:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3456 states. [2019-10-15 01:23:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 5341 transitions. [2019-10-15 01:23:41,202 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 5341 transitions. Word has length 109 [2019-10-15 01:23:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:41,202 INFO L462 AbstractCegarLoop]: Abstraction has 3456 states and 5341 transitions. [2019-10-15 01:23:41,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 5341 transitions. [2019-10-15 01:23:41,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:23:41,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:41,206 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] [2019-10-15 01:23:41,206 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:41,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:41,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2079942452, now seen corresponding path program 1 times [2019-10-15 01:23:41,207 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:41,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023152377] [2019-10-15 01:23:41,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:41,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:41,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:41,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023152377] [2019-10-15 01:23:41,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:41,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:41,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830175166] [2019-10-15 01:23:41,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:41,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:41,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:41,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:41,307 INFO L87 Difference]: Start difference. First operand 3456 states and 5341 transitions. Second operand 3 states. [2019-10-15 01:23:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:41,681 INFO L93 Difference]: Finished difference Result 9594 states and 14954 transitions. [2019-10-15 01:23:41,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:41,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-15 01:23:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:41,717 INFO L225 Difference]: With dead ends: 9594 [2019-10-15 01:23:41,718 INFO L226 Difference]: Without dead ends: 6514 [2019-10-15 01:23:41,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-10-15 01:23:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6512. [2019-10-15 01:23:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-10-15 01:23:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10016 transitions. [2019-10-15 01:23:42,200 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10016 transitions. Word has length 111 [2019-10-15 01:23:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:42,201 INFO L462 AbstractCegarLoop]: Abstraction has 6512 states and 10016 transitions. [2019-10-15 01:23:42,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10016 transitions. [2019-10-15 01:23:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:23:42,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:42,205 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] [2019-10-15 01:23:42,205 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2028254793, now seen corresponding path program 1 times [2019-10-15 01:23:42,206 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:42,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143543635] [2019-10-15 01:23:42,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:42,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143543635] [2019-10-15 01:23:42,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:42,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:42,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159229311] [2019-10-15 01:23:42,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:42,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:42,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:42,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:42,345 INFO L87 Difference]: Start difference. First operand 6512 states and 10016 transitions. Second operand 4 states. [2019-10-15 01:23:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:42,834 INFO L93 Difference]: Finished difference Result 10292 states and 15865 transitions. [2019-10-15 01:23:42,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:42,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-15 01:23:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:42,868 INFO L225 Difference]: With dead ends: 10292 [2019-10-15 01:23:42,868 INFO L226 Difference]: Without dead ends: 5311 [2019-10-15 01:23:42,884 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-15 01:23:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-10-15 01:23:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 5311. [2019-10-15 01:23:43,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2019-10-15 01:23:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 8136 transitions. [2019-10-15 01:23:43,199 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 8136 transitions. Word has length 111 [2019-10-15 01:23:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:43,200 INFO L462 AbstractCegarLoop]: Abstraction has 5311 states and 8136 transitions. [2019-10-15 01:23:43,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 8136 transitions. [2019-10-15 01:23:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:23:43,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:43,203 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] [2019-10-15 01:23:43,203 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:43,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:43,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1274580373, now seen corresponding path program 1 times [2019-10-15 01:23:43,204 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:43,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54552995] [2019-10-15 01:23:43,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:43,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:43,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:43,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54552995] [2019-10-15 01:23:43,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:43,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:43,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216456888] [2019-10-15 01:23:43,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:43,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:43,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:43,297 INFO L87 Difference]: Start difference. First operand 5311 states and 8136 transitions. Second operand 3 states. [2019-10-15 01:23:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:43,872 INFO L93 Difference]: Finished difference Result 13935 states and 21751 transitions. [2019-10-15 01:23:43,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:43,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-15 01:23:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:43,914 INFO L225 Difference]: With dead ends: 13935 [2019-10-15 01:23:43,914 INFO L226 Difference]: Without dead ends: 8965 [2019-10-15 01:23:43,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-10-15 01:23:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8683. [2019-10-15 01:23:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8683 states. [2019-10-15 01:23:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 13503 transitions. [2019-10-15 01:23:44,613 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 13503 transitions. Word has length 113 [2019-10-15 01:23:44,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:44,614 INFO L462 AbstractCegarLoop]: Abstraction has 8683 states and 13503 transitions. [2019-10-15 01:23:44,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 13503 transitions. [2019-10-15 01:23:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:23:44,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:44,617 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] [2019-10-15 01:23:44,618 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:44,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:44,618 INFO L82 PathProgramCache]: Analyzing trace with hash 723633182, now seen corresponding path program 1 times [2019-10-15 01:23:44,618 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:44,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356364359] [2019-10-15 01:23:44,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:44,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356364359] [2019-10-15 01:23:44,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:44,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:44,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675515286] [2019-10-15 01:23:44,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:44,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:44,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:44,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:44,776 INFO L87 Difference]: Start difference. First operand 8683 states and 13503 transitions. Second operand 4 states. [2019-10-15 01:23:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:45,848 INFO L93 Difference]: Finished difference Result 24205 states and 37580 transitions. [2019-10-15 01:23:45,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:45,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:23:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:45,882 INFO L225 Difference]: With dead ends: 24205 [2019-10-15 01:23:45,882 INFO L226 Difference]: Without dead ends: 15565 [2019-10-15 01:23:45,899 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-15 01:23:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2019-10-15 01:23:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 15563. [2019-10-15 01:23:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-10-15 01:23:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23928 transitions. [2019-10-15 01:23:46,923 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23928 transitions. Word has length 114 [2019-10-15 01:23:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:46,923 INFO L462 AbstractCegarLoop]: Abstraction has 15563 states and 23928 transitions. [2019-10-15 01:23:46,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23928 transitions. [2019-10-15 01:23:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:23:46,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:46,928 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] [2019-10-15 01:23:46,929 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1996953920, now seen corresponding path program 1 times [2019-10-15 01:23:46,929 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:46,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99596129] [2019-10-15 01:23:46,930 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,930 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:46,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99596129] [2019-10-15 01:23:46,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:46,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:46,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182131918] [2019-10-15 01:23:46,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:46,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:46,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:46,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:46,997 INFO L87 Difference]: Start difference. First operand 15563 states and 23928 transitions. Second operand 3 states. [2019-10-15 01:23:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:49,328 INFO L93 Difference]: Finished difference Result 46487 states and 71527 transitions. [2019-10-15 01:23:49,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:49,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-10-15 01:23:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:49,406 INFO L225 Difference]: With dead ends: 46487 [2019-10-15 01:23:49,406 INFO L226 Difference]: Without dead ends: 31034 [2019-10-15 01:23:49,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31034 states. [2019-10-15 01:23:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31034 to 15569. [2019-10-15 01:23:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15569 states. [2019-10-15 01:23:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15569 states to 15569 states and 23934 transitions. [2019-10-15 01:23:50,608 INFO L78 Accepts]: Start accepts. Automaton has 15569 states and 23934 transitions. Word has length 115 [2019-10-15 01:23:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:50,609 INFO L462 AbstractCegarLoop]: Abstraction has 15569 states and 23934 transitions. [2019-10-15 01:23:50,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 15569 states and 23934 transitions. [2019-10-15 01:23:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:23:50,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:50,615 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] [2019-10-15 01:23:50,615 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:50,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:50,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1312027809, now seen corresponding path program 1 times [2019-10-15 01:23:50,616 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:50,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705067776] [2019-10-15 01:23:50,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:50,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:50,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:50,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705067776] [2019-10-15 01:23:50,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:50,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:50,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165345915] [2019-10-15 01:23:50,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:50,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:50,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:50,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:50,758 INFO L87 Difference]: Start difference. First operand 15569 states and 23934 transitions. Second operand 4 states. [2019-10-15 01:23:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:51,406 INFO L93 Difference]: Finished difference Result 31096 states and 47812 transitions. [2019-10-15 01:23:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:51,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-15 01:23:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:51,438 INFO L225 Difference]: With dead ends: 31096 [2019-10-15 01:23:51,439 INFO L226 Difference]: Without dead ends: 15563 [2019-10-15 01:23:51,470 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-15 01:23:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15563 states. [2019-10-15 01:23:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15563 to 15563. [2019-10-15 01:23:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-10-15 01:23:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23922 transitions. [2019-10-15 01:23:52,501 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23922 transitions. Word has length 116 [2019-10-15 01:23:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:52,502 INFO L462 AbstractCegarLoop]: Abstraction has 15563 states and 23922 transitions. [2019-10-15 01:23:52,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23922 transitions. [2019-10-15 01:23:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:23:52,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:52,507 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] [2019-10-15 01:23:52,507 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:52,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1204434274, now seen corresponding path program 1 times [2019-10-15 01:23:52,508 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:52,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003099480] [2019-10-15 01:23:52,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:52,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003099480] [2019-10-15 01:23:52,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:52,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589541443] [2019-10-15 01:23:52,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:52,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:52,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:52,599 INFO L87 Difference]: Start difference. First operand 15563 states and 23922 transitions. Second operand 3 states. [2019-10-15 01:23:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:53,659 INFO L93 Difference]: Finished difference Result 37297 states and 57457 transitions. [2019-10-15 01:23:53,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:53,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-15 01:23:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:53,699 INFO L225 Difference]: With dead ends: 37297 [2019-10-15 01:23:53,699 INFO L226 Difference]: Without dead ends: 22487 [2019-10-15 01:23:53,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22487 states. [2019-10-15 01:23:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22487 to 22485. [2019-10-15 01:23:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22485 states. [2019-10-15 01:23:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22485 states to 22485 states and 34047 transitions. [2019-10-15 01:23:55,443 INFO L78 Accepts]: Start accepts. Automaton has 22485 states and 34047 transitions. Word has length 116 [2019-10-15 01:23:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,444 INFO L462 AbstractCegarLoop]: Abstraction has 22485 states and 34047 transitions. [2019-10-15 01:23:55,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 22485 states and 34047 transitions. [2019-10-15 01:23:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:23:55,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,452 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] [2019-10-15 01:23:55,452 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash 306834164, now seen corresponding path program 1 times [2019-10-15 01:23:55,453 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916987338] [2019-10-15 01:23:55,453 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,453 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:55,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916987338] [2019-10-15 01:23:55,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:55,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:55,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406638158] [2019-10-15 01:23:55,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:55,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:55,541 INFO L87 Difference]: Start difference. First operand 22485 states and 34047 transitions. Second operand 3 states. [2019-10-15 01:23:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:58,308 INFO L93 Difference]: Finished difference Result 61641 states and 95217 transitions. [2019-10-15 01:23:58,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:58,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-10-15 01:23:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:58,375 INFO L225 Difference]: With dead ends: 61641 [2019-10-15 01:23:58,376 INFO L226 Difference]: Without dead ends: 42063 [2019-10-15 01:23:58,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42063 states. [2019-10-15 01:24:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42063 to 41977. [2019-10-15 01:24:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41977 states. [2019-10-15 01:24:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41977 states to 41977 states and 63515 transitions. [2019-10-15 01:24:00,376 INFO L78 Accepts]: Start accepts. Automaton has 41977 states and 63515 transitions. Word has length 119 [2019-10-15 01:24:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:00,377 INFO L462 AbstractCegarLoop]: Abstraction has 41977 states and 63515 transitions. [2019-10-15 01:24:00,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 41977 states and 63515 transitions. [2019-10-15 01:24:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:24:00,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:00,381 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] [2019-10-15 01:24:00,382 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:00,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2137277520, now seen corresponding path program 1 times [2019-10-15 01:24:00,382 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:00,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132325162] [2019-10-15 01:24:00,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:00,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:00,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:00,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132325162] [2019-10-15 01:24:00,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:00,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:24:00,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027365715] [2019-10-15 01:24:00,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:24:00,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:00,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:24:00,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:00,670 INFO L87 Difference]: Start difference. First operand 41977 states and 63515 transitions. Second operand 12 states.