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.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:22,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:22,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:22,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:22,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:22,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:22,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:22,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:22,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:22,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:22,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:22,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:22,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:22,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:22,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:22,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:22,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:22,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:22,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:22,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:22,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:22,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:22,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:22,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:22,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:22,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:22,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:22,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:22,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:22,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:22,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:22,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:22,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:22,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:22,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:22,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:22,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:22,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:22,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:22,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:22,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:22,227 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:22,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:22,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:22,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:22,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:22,268 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:22,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:22,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:22,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:22,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:22,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:22,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:22,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:22,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:22,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:22,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:22,271 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:22,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:22,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:22,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:22,272 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:22,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:22,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:22,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:22,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:22,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:22,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:22,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:22,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:22,274 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:22,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:22,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:22,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:22,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:22,607 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:22,607 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.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 21:24:22,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ea76433/3d064877d81746caa3307c49ddf1b325/FLAG6bff4e66d [2019-10-13 21:24:23,367 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:23,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 21:24:23,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ea76433/3d064877d81746caa3307c49ddf1b325/FLAG6bff4e66d [2019-10-13 21:24:23,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ea76433/3d064877d81746caa3307c49ddf1b325 [2019-10-13 21:24:23,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:23,537 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:23,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:23,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:23,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:23,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:23" (1/1) ... [2019-10-13 21:24:23,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef64dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:23, skipping insertion in model container [2019-10-13 21:24:23,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:23" (1/1) ... [2019-10-13 21:24:23,557 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:23,738 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:24,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:24,724 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:25,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:25,109 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:25,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:25 WrapperNode [2019-10-13 21:24:25,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:25,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:25,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:25,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:25,123 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:25" (1/1) ... [2019-10-13 21:24:25,123 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:25" (1/1) ... [2019-10-13 21:24:25,163 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:25" (1/1) ... [2019-10-13 21:24:25,164 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:25" (1/1) ... [2019-10-13 21:24:25,244 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:25" (1/1) ... [2019-10-13 21:24:25,297 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:25" (1/1) ... [2019-10-13 21:24:25,325 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:25" (1/1) ... [2019-10-13 21:24:25,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:25,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:25,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:25,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:25,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:25" (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:25,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:25,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:25,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:25,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:25,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:25,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:25,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:24:25,424 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:25,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:25,425 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:25,425 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:25,426 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:25,426 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:25,427 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:25,427 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:25,427 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:29,032 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:29,032 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:29,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:29 BoogieIcfgContainer [2019-10-13 21:24:29,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:29,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:29,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:29,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:29,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:23" (1/3) ... [2019-10-13 21:24:29,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cefbf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:29, skipping insertion in model container [2019-10-13 21:24:29,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:25" (2/3) ... [2019-10-13 21:24:29,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cefbf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:29, skipping insertion in model container [2019-10-13 21:24:29,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:29" (3/3) ... [2019-10-13 21:24:29,051 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 21:24:29,061 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:29,078 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 21:24:29,088 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 21:24:29,125 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:29,125 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:29,125 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:29,126 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:29,126 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:29,126 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:29,126 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:29,126 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-10-13 21:24:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:29,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:29,184 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:29,186 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:29,192 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-10-13 21:24:29,201 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:29,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805691652] [2019-10-13 21:24:29,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:29,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:29,830 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:29,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805691652] [2019-10-13 21:24:29,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:29,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:29,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807613362] [2019-10-13 21:24:29,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:29,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:29,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:29,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:29,860 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-10-13 21:24:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:32,196 INFO L93 Difference]: Finished difference Result 2475 states and 4331 transitions. [2019-10-13 21:24:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:32,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-13 21:24:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:32,226 INFO L225 Difference]: With dead ends: 2475 [2019-10-13 21:24:32,227 INFO L226 Difference]: Without dead ends: 1554 [2019-10-13 21:24:32,237 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:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-10-13 21:24:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1548. [2019-10-13 21:24:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-13 21:24:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2090 transitions. [2019-10-13 21:24:32,404 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2090 transitions. Word has length 55 [2019-10-13 21:24:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:32,404 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 2090 transitions. [2019-10-13 21:24:32,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2090 transitions. [2019-10-13 21:24:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:32,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:32,411 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:32,412 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:32,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-10-13 21:24:32,414 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:32,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306341716] [2019-10-13 21:24:32,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:32,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:32,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:32,613 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:32,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306341716] [2019-10-13 21:24:32,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:32,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:32,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812035901] [2019-10-13 21:24:32,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:32,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:32,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:32,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:32,619 INFO L87 Difference]: Start difference. First operand 1548 states and 2090 transitions. Second operand 6 states. [2019-10-13 21:24:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:34,092 INFO L93 Difference]: Finished difference Result 3384 states and 4662 transitions. [2019-10-13 21:24:34,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:34,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-13 21:24:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:34,109 INFO L225 Difference]: With dead ends: 3384 [2019-10-13 21:24:34,109 INFO L226 Difference]: Without dead ends: 2296 [2019-10-13 21:24:34,115 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:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-10-13 21:24:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2280. [2019-10-13 21:24:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-10-13 21:24:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3126 transitions. [2019-10-13 21:24:34,248 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3126 transitions. Word has length 56 [2019-10-13 21:24:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:34,249 INFO L462 AbstractCegarLoop]: Abstraction has 2280 states and 3126 transitions. [2019-10-13 21:24:34,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3126 transitions. [2019-10-13 21:24:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:34,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:34,254 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:34,255 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:34,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:34,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-10-13 21:24:34,256 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:34,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788414861] [2019-10-13 21:24:34,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:34,412 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:34,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788414861] [2019-10-13 21:24:34,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:34,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:34,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466526735] [2019-10-13 21:24:34,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:34,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:34,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:34,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:34,416 INFO L87 Difference]: Start difference. First operand 2280 states and 3126 transitions. Second operand 6 states. [2019-10-13 21:24:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:36,120 INFO L93 Difference]: Finished difference Result 5893 states and 8147 transitions. [2019-10-13 21:24:36,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:36,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-13 21:24:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:36,148 INFO L225 Difference]: With dead ends: 5893 [2019-10-13 21:24:36,149 INFO L226 Difference]: Without dead ends: 4335 [2019-10-13 21:24:36,154 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:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2019-10-13 21:24:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4315. [2019-10-13 21:24:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-13 21:24:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5971 transitions. [2019-10-13 21:24:36,390 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5971 transitions. Word has length 56 [2019-10-13 21:24:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:36,393 INFO L462 AbstractCegarLoop]: Abstraction has 4315 states and 5971 transitions. [2019-10-13 21:24:36,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5971 transitions. [2019-10-13 21:24:36,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:36,399 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:36,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:36,400 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:36,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:36,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-10-13 21:24:36,400 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:36,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061632751] [2019-10-13 21:24:36,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:36,640 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,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061632751] [2019-10-13 21:24:36,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:36,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:36,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086943018] [2019-10-13 21:24:36,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:36,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:36,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:36,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:36,643 INFO L87 Difference]: Start difference. First operand 4315 states and 5971 transitions. Second operand 9 states. [2019-10-13 21:24:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:40,755 INFO L93 Difference]: Finished difference Result 8360 states and 12149 transitions. [2019-10-13 21:24:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:24:40,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-13 21:24:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:40,804 INFO L225 Difference]: With dead ends: 8360 [2019-10-13 21:24:40,804 INFO L226 Difference]: Without dead ends: 8355 [2019-10-13 21:24:40,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:24:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states. [2019-10-13 21:24:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 4315. [2019-10-13 21:24:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-13 21:24:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5970 transitions. [2019-10-13 21:24:41,110 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5970 transitions. Word has length 57 [2019-10-13 21:24:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:41,111 INFO L462 AbstractCegarLoop]: Abstraction has 4315 states and 5970 transitions. [2019-10-13 21:24:41,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5970 transitions. [2019-10-13 21:24:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:41,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:41,117 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:41,118 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-10-13 21:24:41,119 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:41,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977880099] [2019-10-13 21:24:41,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:41,332 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,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977880099] [2019-10-13 21:24:41,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:41,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:41,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851282443] [2019-10-13 21:24:41,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:41,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:41,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:41,336 INFO L87 Difference]: Start difference. First operand 4315 states and 5970 transitions. Second operand 9 states. [2019-10-13 21:24:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:45,236 INFO L93 Difference]: Finished difference Result 12184 states and 17666 transitions. [2019-10-13 21:24:45,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:24:45,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-13 21:24:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:45,292 INFO L225 Difference]: With dead ends: 12184 [2019-10-13 21:24:45,293 INFO L226 Difference]: Without dead ends: 11066 [2019-10-13 21:24:45,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:24:45,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-10-13 21:24:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4315. [2019-10-13 21:24:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-13 21:24:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5969 transitions. [2019-10-13 21:24:45,708 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5969 transitions. Word has length 57 [2019-10-13 21:24:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:45,710 INFO L462 AbstractCegarLoop]: Abstraction has 4315 states and 5969 transitions. [2019-10-13 21:24:45,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5969 transitions. [2019-10-13 21:24:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:45,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:45,718 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:45,719 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:45,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:45,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-10-13 21:24:45,720 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:45,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391261089] [2019-10-13 21:24:45,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:45,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:45,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:45,971 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:45,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391261089] [2019-10-13 21:24:45,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:45,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:24:45,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131851388] [2019-10-13 21:24:45,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:24:45,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:45,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:24:45,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:45,974 INFO L87 Difference]: Start difference. First operand 4315 states and 5969 transitions. Second operand 8 states. [2019-10-13 21:24:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:49,222 INFO L93 Difference]: Finished difference Result 9387 states and 13823 transitions. [2019-10-13 21:24:49,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:24:49,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-13 21:24:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:49,240 INFO L225 Difference]: With dead ends: 9387 [2019-10-13 21:24:49,240 INFO L226 Difference]: Without dead ends: 8061 [2019-10-13 21:24:49,245 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:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2019-10-13 21:24:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 4315. [2019-10-13 21:24:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-13 21:24:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5968 transitions. [2019-10-13 21:24:49,518 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5968 transitions. Word has length 57 [2019-10-13 21:24:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:49,518 INFO L462 AbstractCegarLoop]: Abstraction has 4315 states and 5968 transitions. [2019-10-13 21:24:49,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:24:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5968 transitions. [2019-10-13 21:24:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:49,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:49,523 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:49,523 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:49,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:49,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-10-13 21:24:49,524 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:49,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073378743] [2019-10-13 21:24:49,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:49,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-13 21:24:49,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073378743] [2019-10-13 21:24:49,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:49,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:49,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394554300] [2019-10-13 21:24:49,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:49,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:49,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:49,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:49,599 INFO L87 Difference]: Start difference. First operand 4315 states and 5968 transitions. Second operand 3 states. [2019-10-13 21:24:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:50,002 INFO L93 Difference]: Finished difference Result 7979 states and 11287 transitions. [2019-10-13 21:24:50,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:50,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 21:24:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:50,018 INFO L225 Difference]: With dead ends: 7979 [2019-10-13 21:24:50,018 INFO L226 Difference]: Without dead ends: 5459 [2019-10-13 21:24:50,026 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:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5459 states. [2019-10-13 21:24:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5459 to 5453. [2019-10-13 21:24:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-10-13 21:24:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 7525 transitions. [2019-10-13 21:24:50,454 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 7525 transitions. Word has length 58 [2019-10-13 21:24:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:50,455 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 7525 transitions. [2019-10-13 21:24:50,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 7525 transitions. [2019-10-13 21:24:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:50,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:50,461 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:50,461 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:50,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:50,461 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-10-13 21:24:50,462 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:50,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912163122] [2019-10-13 21:24:50,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,544 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:50,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912163122] [2019-10-13 21:24:50,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:50,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942365284] [2019-10-13 21:24:50,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:50,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:50,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:50,547 INFO L87 Difference]: Start difference. First operand 5453 states and 7525 transitions. Second operand 3 states. [2019-10-13 21:24:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,071 INFO L93 Difference]: Finished difference Result 8882 states and 12823 transitions. [2019-10-13 21:24:51,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:51,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 21:24:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,086 INFO L225 Difference]: With dead ends: 8882 [2019-10-13 21:24:51,087 INFO L226 Difference]: Without dead ends: 6617 [2019-10-13 21:24:51,095 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:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2019-10-13 21:24:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6025. [2019-10-13 21:24:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6025 states. [2019-10-13 21:24:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8443 transitions. [2019-10-13 21:24:51,530 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8443 transitions. Word has length 58 [2019-10-13 21:24:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,530 INFO L462 AbstractCegarLoop]: Abstraction has 6025 states and 8443 transitions. [2019-10-13 21:24:51,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8443 transitions. [2019-10-13 21:24:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:51,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:51,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:51,534 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:51,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:51,535 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-10-13 21:24:51,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:51,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802702578] [2019-10-13 21:24:51,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:51,608 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:51,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802702578] [2019-10-13 21:24:51,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:51,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:51,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200411617] [2019-10-13 21:24:51,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:51,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:51,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:51,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:51,610 INFO L87 Difference]: Start difference. First operand 6025 states and 8443 transitions. Second operand 3 states. [2019-10-13 21:24:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:52,400 INFO L93 Difference]: Finished difference Result 11249 states and 16372 transitions. [2019-10-13 21:24:52,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:52,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 21:24:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:52,420 INFO L225 Difference]: With dead ends: 11249 [2019-10-13 21:24:52,420 INFO L226 Difference]: Without dead ends: 8007 [2019-10-13 21:24:52,431 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:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8007 states. [2019-10-13 21:24:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8007 to 7105. [2019-10-13 21:24:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-10-13 21:24:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 10025 transitions. [2019-10-13 21:24:53,077 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 10025 transitions. Word has length 58 [2019-10-13 21:24:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:53,077 INFO L462 AbstractCegarLoop]: Abstraction has 7105 states and 10025 transitions. [2019-10-13 21:24:53,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 10025 transitions. [2019-10-13 21:24:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:53,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:53,082 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:53,082 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-10-13 21:24:53,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:53,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921245454] [2019-10-13 21:24:53,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:53,140 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:53,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921245454] [2019-10-13 21:24:53,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:53,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:53,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084089015] [2019-10-13 21:24:53,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:53,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:53,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:53,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:53,142 INFO L87 Difference]: Start difference. First operand 7105 states and 10025 transitions. Second operand 3 states. [2019-10-13 21:24:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:54,177 INFO L93 Difference]: Finished difference Result 13710 states and 19567 transitions. [2019-10-13 21:24:54,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:54,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-13 21:24:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:54,197 INFO L225 Difference]: With dead ends: 13710 [2019-10-13 21:24:54,198 INFO L226 Difference]: Without dead ends: 7194 [2019-10-13 21:24:54,216 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:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states.