java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:13,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:13,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:13,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:13,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:13,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:13,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:13,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:13,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:13,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:13,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:13,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:13,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:13,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:13,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:13,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:13,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:13,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:13,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:13,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:13,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:13,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:13,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:13,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:13,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:13,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:13,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:13,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:13,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:13,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:13,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:13,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:13,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:13,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:13,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:13,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:13,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:13,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:13,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:13,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:13,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:13,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:24:13,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:13,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:13,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:13,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:13,219 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:13,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:13,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:13,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:13,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:13,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:13,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:13,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:13,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:13,221 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:13,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:13,221 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:13,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:13,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:13,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:13,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:13,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:13,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:13,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:13,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:13,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:13,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:13,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:13,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:13,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:24:13,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:13,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:13,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:13,545 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:13,545 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:13,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-13 21:24:13,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76333cea/0a50a03a66aa46ab9b2419c7ab5ccf8c/FLAGc31a388a2 [2019-10-13 21:24:14,338 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:14,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-13 21:24:14,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76333cea/0a50a03a66aa46ab9b2419c7ab5ccf8c/FLAGc31a388a2 [2019-10-13 21:24:14,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76333cea/0a50a03a66aa46ab9b2419c7ab5ccf8c [2019-10-13 21:24:14,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:14,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:14,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:14,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:14,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:14,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5187dd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:14, skipping insertion in model container [2019-10-13 21:24:14,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:14" (1/1) ... [2019-10-13 21:24:14,493 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:14,673 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:15,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:15,655 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:16,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:16,082 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:16,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:16 WrapperNode [2019-10-13 21:24:16,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:16,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:16,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:16,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:16,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:16" (1/1) ... [2019-10-13 21:24:16,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:16" (1/1) ... [2019-10-13 21:24:16,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:16" (1/1) ... [2019-10-13 21:24:16,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:16" (1/1) ... [2019-10-13 21:24:16,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:16" (1/1) ... [2019-10-13 21:24:16,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:16" (1/1) ... [2019-10-13 21:24:16,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:16" (1/1) ... [2019-10-13 21:24:16,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:16,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:16,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:16,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:16,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:16,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:16,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:16,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:16,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:16,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:19,878 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:19,879 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:19,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:19 BoogieIcfgContainer [2019-10-13 21:24:19,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:19,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:19,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:19,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:19,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:14" (1/3) ... [2019-10-13 21:24:19,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112e6561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:19, skipping insertion in model container [2019-10-13 21:24:19,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:16" (2/3) ... [2019-10-13 21:24:19,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112e6561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:19, skipping insertion in model container [2019-10-13 21:24:19,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:19" (3/3) ... [2019-10-13 21:24:19,890 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-13 21:24:19,901 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:19,912 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 21:24:19,924 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 21:24:19,964 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:19,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:19,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:19,965 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:19,965 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:19,965 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:19,965 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:19,966 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states. [2019-10-13 21:24:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:20,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:20,049 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:20,051 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:20,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:20,058 INFO L82 PathProgramCache]: Analyzing trace with hash 543541410, now seen corresponding path program 1 times [2019-10-13 21:24:20,065 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:20,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876660704] [2019-10-13 21:24:20,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:20,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:20,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:20,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876660704] [2019-10-13 21:24:20,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:20,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:20,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023467043] [2019-10-13 21:24:20,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:20,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:20,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:20,856 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand 5 states. [2019-10-13 21:24:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:23,227 INFO L93 Difference]: Finished difference Result 2522 states and 4334 transitions. [2019-10-13 21:24:23,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:23,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-13 21:24:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:23,261 INFO L225 Difference]: With dead ends: 2522 [2019-10-13 21:24:23,262 INFO L226 Difference]: Without dead ends: 1594 [2019-10-13 21:24:23,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2019-10-13 21:24:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1588. [2019-10-13 21:24:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2019-10-13 21:24:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2070 transitions. [2019-10-13 21:24:23,446 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2070 transitions. Word has length 56 [2019-10-13 21:24:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:23,447 INFO L462 AbstractCegarLoop]: Abstraction has 1588 states and 2070 transitions. [2019-10-13 21:24:23,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2070 transitions. [2019-10-13 21:24:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:23,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:23,456 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:23,456 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:23,457 INFO L82 PathProgramCache]: Analyzing trace with hash 653011577, now seen corresponding path program 1 times [2019-10-13 21:24:23,458 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:23,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021258416] [2019-10-13 21:24:23,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:23,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:23,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:23,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021258416] [2019-10-13 21:24:23,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:23,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:23,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96914574] [2019-10-13 21:24:23,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:23,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:23,712 INFO L87 Difference]: Start difference. First operand 1588 states and 2070 transitions. Second operand 6 states. [2019-10-13 21:24:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:25,253 INFO L93 Difference]: Finished difference Result 3593 states and 4735 transitions. [2019-10-13 21:24:25,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:25,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-13 21:24:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:25,268 INFO L225 Difference]: With dead ends: 3593 [2019-10-13 21:24:25,268 INFO L226 Difference]: Without dead ends: 2603 [2019-10-13 21:24:25,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-10-13 21:24:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2580. [2019-10-13 21:24:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2019-10-13 21:24:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3414 transitions. [2019-10-13 21:24:25,394 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3414 transitions. Word has length 57 [2019-10-13 21:24:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:25,394 INFO L462 AbstractCegarLoop]: Abstraction has 2580 states and 3414 transitions. [2019-10-13 21:24:25,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3414 transitions. [2019-10-13 21:24:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:25,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:25,399 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:25,399 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:25,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2124615921, now seen corresponding path program 1 times [2019-10-13 21:24:25,400 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:25,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208713464] [2019-10-13 21:24:25,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:25,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:25,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:25,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208713464] [2019-10-13 21:24:25,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:25,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:25,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342263693] [2019-10-13 21:24:25,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:25,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:25,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:25,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:25,572 INFO L87 Difference]: Start difference. First operand 2580 states and 3414 transitions. Second operand 6 states. [2019-10-13 21:24:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:26,920 INFO L93 Difference]: Finished difference Result 6102 states and 8181 transitions. [2019-10-13 21:24:26,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:26,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-13 21:24:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:26,947 INFO L225 Difference]: With dead ends: 6102 [2019-10-13 21:24:26,947 INFO L226 Difference]: Without dead ends: 4454 [2019-10-13 21:24:26,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-10-13 21:24:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4438. [2019-10-13 21:24:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-13 21:24:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5921 transitions. [2019-10-13 21:24:27,160 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5921 transitions. Word has length 57 [2019-10-13 21:24:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:27,162 INFO L462 AbstractCegarLoop]: Abstraction has 4438 states and 5921 transitions. [2019-10-13 21:24:27,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5921 transitions. [2019-10-13 21:24:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:27,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:27,167 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:27,168 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1225390693, now seen corresponding path program 1 times [2019-10-13 21:24:27,168 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:27,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507561677] [2019-10-13 21:24:27,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:27,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:27,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:27,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507561677] [2019-10-13 21:24:27,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:27,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:27,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559192359] [2019-10-13 21:24:27,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:27,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:27,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:27,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:27,483 INFO L87 Difference]: Start difference. First operand 4438 states and 5921 transitions. Second operand 9 states. [2019-10-13 21:24:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:31,065 INFO L93 Difference]: Finished difference Result 8492 states and 12034 transitions. [2019-10-13 21:24:31,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:24:31,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-13 21:24:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:31,105 INFO L225 Difference]: With dead ends: 8492 [2019-10-13 21:24:31,105 INFO L226 Difference]: Without dead ends: 8486 [2019-10-13 21:24:31,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:24:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2019-10-13 21:24:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 4438. [2019-10-13 21:24:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-13 21:24:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5920 transitions. [2019-10-13 21:24:31,524 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5920 transitions. Word has length 59 [2019-10-13 21:24:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:31,525 INFO L462 AbstractCegarLoop]: Abstraction has 4438 states and 5920 transitions. [2019-10-13 21:24:31,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5920 transitions. [2019-10-13 21:24:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:31,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:31,531 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:31,532 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2072576560, now seen corresponding path program 1 times [2019-10-13 21:24:31,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:31,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916704003] [2019-10-13 21:24:31,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:31,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:31,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:31,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916704003] [2019-10-13 21:24:31,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:31,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:31,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945580611] [2019-10-13 21:24:31,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:31,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:31,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:31,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:31,845 INFO L87 Difference]: Start difference. First operand 4438 states and 5920 transitions. Second operand 9 states. [2019-10-13 21:24:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:35,428 INFO L93 Difference]: Finished difference Result 12604 states and 17782 transitions. [2019-10-13 21:24:35,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:24:35,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-13 21:24:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:35,484 INFO L225 Difference]: With dead ends: 12604 [2019-10-13 21:24:35,485 INFO L226 Difference]: Without dead ends: 11461 [2019-10-13 21:24:35,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:24:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-10-13 21:24:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 4438. [2019-10-13 21:24:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-13 21:24:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5919 transitions. [2019-10-13 21:24:35,875 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5919 transitions. Word has length 59 [2019-10-13 21:24:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:35,875 INFO L462 AbstractCegarLoop]: Abstraction has 4438 states and 5919 transitions. [2019-10-13 21:24:35,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5919 transitions. [2019-10-13 21:24:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:35,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:35,880 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:35,881 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1462179803, now seen corresponding path program 1 times [2019-10-13 21:24:35,881 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:35,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260457814] [2019-10-13 21:24:35,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:35,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:35,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:36,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260457814] [2019-10-13 21:24:36,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:36,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:24:36,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433761741] [2019-10-13 21:24:36,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:24:36,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:36,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:24:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:36,129 INFO L87 Difference]: Start difference. First operand 4438 states and 5919 transitions. Second operand 8 states. [2019-10-13 21:24:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:38,940 INFO L93 Difference]: Finished difference Result 9646 states and 13819 transitions. [2019-10-13 21:24:38,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:24:38,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-10-13 21:24:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:38,958 INFO L225 Difference]: With dead ends: 9646 [2019-10-13 21:24:38,958 INFO L226 Difference]: Without dead ends: 8253 [2019-10-13 21:24:38,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:24:38,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8253 states. [2019-10-13 21:24:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8253 to 4438. [2019-10-13 21:24:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-13 21:24:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5918 transitions. [2019-10-13 21:24:39,240 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5918 transitions. Word has length 59 [2019-10-13 21:24:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:39,242 INFO L462 AbstractCegarLoop]: Abstraction has 4438 states and 5918 transitions. [2019-10-13 21:24:39,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:24:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5918 transitions. [2019-10-13 21:24:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:39,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:39,249 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:39,250 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:39,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:39,250 INFO L82 PathProgramCache]: Analyzing trace with hash 895594476, now seen corresponding path program 1 times [2019-10-13 21:24:39,250 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:39,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038079549] [2019-10-13 21:24:39,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:39,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038079549] [2019-10-13 21:24:39,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:39,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:39,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298519787] [2019-10-13 21:24:39,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:39,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:39,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:39,361 INFO L87 Difference]: Start difference. First operand 4438 states and 5918 transitions. Second operand 3 states. [2019-10-13 21:24:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:39,896 INFO L93 Difference]: Finished difference Result 8143 states and 11088 transitions. [2019-10-13 21:24:39,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:39,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 21:24:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:39,910 INFO L225 Difference]: With dead ends: 8143 [2019-10-13 21:24:39,911 INFO L226 Difference]: Without dead ends: 5548 [2019-10-13 21:24:39,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2019-10-13 21:24:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5542. [2019-10-13 21:24:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2019-10-13 21:24:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7349 transitions. [2019-10-13 21:24:40,182 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7349 transitions. Word has length 60 [2019-10-13 21:24:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:40,182 INFO L462 AbstractCegarLoop]: Abstraction has 5542 states and 7349 transitions. [2019-10-13 21:24:40,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7349 transitions. [2019-10-13 21:24:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:40,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:40,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:40,188 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:40,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1516341452, now seen corresponding path program 1 times [2019-10-13 21:24:40,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:40,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942995854] [2019-10-13 21:24:40,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:40,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942995854] [2019-10-13 21:24:40,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:40,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:40,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502616417] [2019-10-13 21:24:40,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:40,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:40,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:40,281 INFO L87 Difference]: Start difference. First operand 5542 states and 7349 transitions. Second operand 3 states. [2019-10-13 21:24:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:40,737 INFO L93 Difference]: Finished difference Result 9044 states and 12648 transitions. [2019-10-13 21:24:40,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:40,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 21:24:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:40,751 INFO L225 Difference]: With dead ends: 9044 [2019-10-13 21:24:40,752 INFO L226 Difference]: Without dead ends: 6694 [2019-10-13 21:24:40,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2019-10-13 21:24:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 6090. [2019-10-13 21:24:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6090 states. [2019-10-13 21:24:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 8232 transitions. [2019-10-13 21:24:41,190 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 8232 transitions. Word has length 60 [2019-10-13 21:24:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:41,191 INFO L462 AbstractCegarLoop]: Abstraction has 6090 states and 8232 transitions. [2019-10-13 21:24:41,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 8232 transitions. [2019-10-13 21:24:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:24:41,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:41,195 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:41,196 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:41,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:41,196 INFO L82 PathProgramCache]: Analyzing trace with hash -514589220, now seen corresponding path program 1 times [2019-10-13 21:24:41,196 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:41,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805925721] [2019-10-13 21:24:41,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:41,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805925721] [2019-10-13 21:24:41,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:41,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:41,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853792001] [2019-10-13 21:24:41,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:41,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:41,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:41,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:41,286 INFO L87 Difference]: Start difference. First operand 6090 states and 8232 transitions. Second operand 3 states. [2019-10-13 21:24:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:41,875 INFO L93 Difference]: Finished difference Result 11404 states and 16131 transitions. [2019-10-13 21:24:41,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:41,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 21:24:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:41,888 INFO L225 Difference]: With dead ends: 11404 [2019-10-13 21:24:41,888 INFO L226 Difference]: Without dead ends: 8067 [2019-10-13 21:24:41,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-10-13 21:24:42,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 7151. [2019-10-13 21:24:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-10-13 21:24:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 9773 transitions. [2019-10-13 21:24:42,439 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 9773 transitions. Word has length 60 [2019-10-13 21:24:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:42,440 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 9773 transitions. [2019-10-13 21:24:42,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 9773 transitions. [2019-10-13 21:24:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 21:24:42,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:42,444 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:42,444 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash -293371609, now seen corresponding path program 1 times [2019-10-13 21:24:42,445 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:42,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706423913] [2019-10-13 21:24:42,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:42,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:42,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:42,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706423913] [2019-10-13 21:24:42,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:42,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:42,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284321728] [2019-10-13 21:24:42,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:42,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:42,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:42,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:42,528 INFO L87 Difference]: Start difference. First operand 7151 states and 9773 transitions. Second operand 3 states. [2019-10-13 21:24:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:43,468 INFO L93 Difference]: Finished difference Result 15308 states and 21660 transitions. [2019-10-13 21:24:43,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:43,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-13 21:24:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:43,490 INFO L225 Difference]: With dead ends: 15308 [2019-10-13 21:24:43,490 INFO L226 Difference]: Without dead ends: 9721 [2019-10-13 21:24:43,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9721 states. [2019-10-13 21:24:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9721 to 7854. [2019-10-13 21:24:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7854 states. [2019-10-13 21:24:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7854 states to 7854 states and 11004 transitions. [2019-10-13 21:24:44,165 INFO L78 Accepts]: Start accepts. Automaton has 7854 states and 11004 transitions. Word has length 61 [2019-10-13 21:24:44,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:44,165 INFO L462 AbstractCegarLoop]: Abstraction has 7854 states and 11004 transitions. [2019-10-13 21:24:44,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 7854 states and 11004 transitions. [2019-10-13 21:24:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 21:24:44,169 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:44,169 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:44,170 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:44,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2069285283, now seen corresponding path program 1 times [2019-10-13 21:24:44,170 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:44,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900057137] [2019-10-13 21:24:44,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:44,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:44,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:44,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900057137] [2019-10-13 21:24:44,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:44,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:24:44,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111790439] [2019-10-13 21:24:44,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:24:44,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:44,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:24:44,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:24:44,697 INFO L87 Difference]: Start difference. First operand 7854 states and 11004 transitions. Second operand 10 states.