/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:06:59,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:59,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:59,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:59,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:59,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:59,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:59,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:59,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:59,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:59,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:59,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:59,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:59,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:59,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:59,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:59,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:59,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:59,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:59,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:59,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:59,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:59,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:59,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:59,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:59,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:59,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:59,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:59,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:59,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:59,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:59,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:59,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:59,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:59,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:59,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:59,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:59,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:59,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:59,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:59,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:59,306 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-11-07 01:06:59,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:59,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:59,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:59,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:59,322 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:59,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:59,323 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:59,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:59,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:59,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:59,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:59,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:59,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:59,324 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:59,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:59,326 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:59,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:59,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:59,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:59,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:59,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:59,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:59,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:59,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:59,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:59,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:59,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:59,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:59,329 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-11-07 01:06:59,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:06:59,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:06:59,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:06:59,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:06:59,654 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:06:59,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:06:59,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588f9d58e/62d460eee54b4b72ad20cc0a78100603/FLAG0d89d158f [2019-11-07 01:07:00,302 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:07:00,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:07:00,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588f9d58e/62d460eee54b4b72ad20cc0a78100603/FLAG0d89d158f [2019-11-07 01:07:00,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588f9d58e/62d460eee54b4b72ad20cc0a78100603 [2019-11-07 01:07:00,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:07:00,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:07:00,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:00,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:07:00,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:07:00,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:00" (1/1) ... [2019-11-07 01:07:00,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:00, skipping insertion in model container [2019-11-07 01:07:00,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:00" (1/1) ... [2019-11-07 01:07:00,606 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:07:00,685 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:07:01,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:01,485 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:07:01,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:07:01,957 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:07:01,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01 WrapperNode [2019-11-07 01:07:01,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:07:01,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:07:01,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:07:01,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:07:01,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:01,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:01,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:01,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (1/1) ... [2019-11-07 01:07:02,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:07:02,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:07:02,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:07:02,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:07:02,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (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-11-07 01:07:02,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:07:02,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:07:02,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:07:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:07:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:07:02,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:07:02,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:07:02,167 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:07:02,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:07:02,168 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:07:02,168 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:07:02,168 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:07:02,169 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:07:02,170 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:07:02,170 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:07:02,170 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:07:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:07:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:07:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:07:04,042 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:07:04,042 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:07:04,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:04 BoogieIcfgContainer [2019-11-07 01:07:04,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:07:04,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:07:04,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:07:04,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:07:04,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:07:00" (1/3) ... [2019-11-07 01:07:04,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7964699a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:04, skipping insertion in model container [2019-11-07 01:07:04,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:01" (2/3) ... [2019-11-07 01:07:04,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7964699a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:04, skipping insertion in model container [2019-11-07 01:07:04,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:04" (3/3) ... [2019-11-07 01:07:04,060 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:07:04,073 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:07:04,098 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 01:07:04,111 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 01:07:04,141 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:07:04,141 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:07:04,141 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:07:04,142 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:07:04,142 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:07:04,142 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:07:04,142 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:07:04,142 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:07:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states. [2019-11-07 01:07:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:07:04,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:04,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:04,194 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:04,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:04,201 INFO L82 PathProgramCache]: Analyzing trace with hash 257827157, now seen corresponding path program 1 times [2019-11-07 01:07:04,213 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:04,213 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422769182] [2019-11-07 01:07:04,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:04,926 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422769182] [2019-11-07 01:07:04,926 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:04,927 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:04,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415548485] [2019-11-07 01:07:04,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:04,938 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:04,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:04,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:04,956 INFO L87 Difference]: Start difference. First operand 416 states. Second operand 3 states. [2019-11-07 01:07:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:05,212 INFO L93 Difference]: Finished difference Result 759 states and 1331 transitions. [2019-11-07 01:07:05,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:05,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-07 01:07:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:05,247 INFO L225 Difference]: With dead ends: 759 [2019-11-07 01:07:05,247 INFO L226 Difference]: Without dead ends: 590 [2019-11-07 01:07:05,252 INFO L630 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-11-07 01:07:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-11-07 01:07:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2019-11-07 01:07:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-11-07 01:07:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 857 transitions. [2019-11-07 01:07:05,374 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 857 transitions. Word has length 151 [2019-11-07 01:07:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:05,375 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 857 transitions. [2019-11-07 01:07:05,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 857 transitions. [2019-11-07 01:07:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:07:05,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:05,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:05,380 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:05,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1201169525, now seen corresponding path program 1 times [2019-11-07 01:07:05,381 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:05,381 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324207606] [2019-11-07 01:07:05,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:05,612 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324207606] [2019-11-07 01:07:05,613 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:05,613 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:05,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687966228] [2019-11-07 01:07:05,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:05,617 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:05,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:05,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:05,617 INFO L87 Difference]: Start difference. First operand 588 states and 857 transitions. Second operand 3 states. [2019-11-07 01:07:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:05,824 INFO L93 Difference]: Finished difference Result 1187 states and 1790 transitions. [2019-11-07 01:07:05,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:05,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-07 01:07:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:05,831 INFO L225 Difference]: With dead ends: 1187 [2019-11-07 01:07:05,832 INFO L226 Difference]: Without dead ends: 964 [2019-11-07 01:07:05,835 INFO L630 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-11-07 01:07:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-11-07 01:07:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2019-11-07 01:07:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-11-07 01:07:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1427 transitions. [2019-11-07 01:07:05,887 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1427 transitions. Word has length 151 [2019-11-07 01:07:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:05,888 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1427 transitions. [2019-11-07 01:07:05,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1427 transitions. [2019-11-07 01:07:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 01:07:05,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:05,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:05,892 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1200830901, now seen corresponding path program 1 times [2019-11-07 01:07:05,893 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:05,893 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355784888] [2019-11-07 01:07:05,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:06,337 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355784888] [2019-11-07 01:07:06,338 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:06,338 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:06,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743753390] [2019-11-07 01:07:06,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:06,342 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:06,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:06,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:06,347 INFO L87 Difference]: Start difference. First operand 962 states and 1427 transitions. Second operand 4 states. [2019-11-07 01:07:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:06,534 INFO L93 Difference]: Finished difference Result 2828 states and 4188 transitions. [2019-11-07 01:07:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:06,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-07 01:07:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:06,548 INFO L225 Difference]: With dead ends: 2828 [2019-11-07 01:07:06,557 INFO L226 Difference]: Without dead ends: 1879 [2019-11-07 01:07:06,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-11-07 01:07:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1837. [2019-11-07 01:07:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-11-07 01:07:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2717 transitions. [2019-11-07 01:07:06,651 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2717 transitions. Word has length 151 [2019-11-07 01:07:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:06,651 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2717 transitions. [2019-11-07 01:07:06,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2717 transitions. [2019-11-07 01:07:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:07:06,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:06,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:06,660 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:06,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:06,660 INFO L82 PathProgramCache]: Analyzing trace with hash -958267271, now seen corresponding path program 1 times [2019-11-07 01:07:06,661 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:06,661 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293520204] [2019-11-07 01:07:06,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:06,750 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293520204] [2019-11-07 01:07:06,750 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:06,751 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:06,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251560684] [2019-11-07 01:07:06,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:06,752 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:06,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:06,753 INFO L87 Difference]: Start difference. First operand 1837 states and 2717 transitions. Second operand 3 states. [2019-11-07 01:07:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:06,908 INFO L93 Difference]: Finished difference Result 5465 states and 8081 transitions. [2019-11-07 01:07:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:06,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-07 01:07:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:06,927 INFO L225 Difference]: With dead ends: 5465 [2019-11-07 01:07:06,927 INFO L226 Difference]: Without dead ends: 3660 [2019-11-07 01:07:06,932 INFO L630 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-11-07 01:07:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-11-07 01:07:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 1839. [2019-11-07 01:07:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2019-11-07 01:07:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2719 transitions. [2019-11-07 01:07:07,099 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2719 transitions. Word has length 152 [2019-11-07 01:07:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:07,099 INFO L462 AbstractCegarLoop]: Abstraction has 1839 states and 2719 transitions. [2019-11-07 01:07:07,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2719 transitions. [2019-11-07 01:07:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 01:07:07,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:07,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:07,104 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:07,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:07,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1744211523, now seen corresponding path program 1 times [2019-11-07 01:07:07,105 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:07,105 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603338963] [2019-11-07 01:07:07,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:07,223 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603338963] [2019-11-07 01:07:07,223 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:07,223 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:07,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781117933] [2019-11-07 01:07:07,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:07,224 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:07,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:07,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:07,225 INFO L87 Difference]: Start difference. First operand 1839 states and 2719 transitions. Second operand 3 states. [2019-11-07 01:07:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:07,449 INFO L93 Difference]: Finished difference Result 5196 states and 7684 transitions. [2019-11-07 01:07:07,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:07,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-07 01:07:07,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:07,469 INFO L225 Difference]: With dead ends: 5196 [2019-11-07 01:07:07,469 INFO L226 Difference]: Without dead ends: 3554 [2019-11-07 01:07:07,474 INFO L630 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-11-07 01:07:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-11-07 01:07:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3512. [2019-11-07 01:07:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2019-11-07 01:07:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5152 transitions. [2019-11-07 01:07:07,707 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5152 transitions. Word has length 153 [2019-11-07 01:07:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:07,708 INFO L462 AbstractCegarLoop]: Abstraction has 3512 states and 5152 transitions. [2019-11-07 01:07:07,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5152 transitions. [2019-11-07 01:07:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 01:07:07,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:07,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:07,719 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash 294713414, now seen corresponding path program 1 times [2019-11-07 01:07:07,720 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:07,720 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175466641] [2019-11-07 01:07:07,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:07,945 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175466641] [2019-11-07 01:07:07,946 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:07,946 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:07,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741687416] [2019-11-07 01:07:07,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:07,947 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:07,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:07,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:07,948 INFO L87 Difference]: Start difference. First operand 3512 states and 5152 transitions. Second operand 4 states. [2019-11-07 01:07:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:08,142 INFO L93 Difference]: Finished difference Result 6017 states and 8836 transitions. [2019-11-07 01:07:08,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:08,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-07 01:07:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:08,163 INFO L225 Difference]: With dead ends: 6017 [2019-11-07 01:07:08,163 INFO L226 Difference]: Without dead ends: 2690 [2019-11-07 01:07:08,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2019-11-07 01:07:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690. [2019-11-07 01:07:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2019-11-07 01:07:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3933 transitions. [2019-11-07 01:07:08,381 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3933 transitions. Word has length 153 [2019-11-07 01:07:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:08,385 INFO L462 AbstractCegarLoop]: Abstraction has 2690 states and 3933 transitions. [2019-11-07 01:07:08,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3933 transitions. [2019-11-07 01:07:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:07:08,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:08,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:08,411 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:08,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:08,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2083946363, now seen corresponding path program 1 times [2019-11-07 01:07:08,414 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:08,416 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554685210] [2019-11-07 01:07:08,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:08,629 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554685210] [2019-11-07 01:07:08,630 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:08,630 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:08,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597171493] [2019-11-07 01:07:08,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:08,632 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:08,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:08,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:08,632 INFO L87 Difference]: Start difference. First operand 2690 states and 3933 transitions. Second operand 3 states. [2019-11-07 01:07:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:08,835 INFO L93 Difference]: Finished difference Result 6148 states and 9216 transitions. [2019-11-07 01:07:08,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:08,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-07 01:07:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:08,853 INFO L225 Difference]: With dead ends: 6148 [2019-11-07 01:07:08,854 INFO L226 Difference]: Without dead ends: 3644 [2019-11-07 01:07:08,860 INFO L630 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-11-07 01:07:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2019-11-07 01:07:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3558. [2019-11-07 01:07:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2019-11-07 01:07:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5350 transitions. [2019-11-07 01:07:09,058 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5350 transitions. Word has length 154 [2019-11-07 01:07:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:09,058 INFO L462 AbstractCegarLoop]: Abstraction has 3558 states and 5350 transitions. [2019-11-07 01:07:09,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5350 transitions. [2019-11-07 01:07:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:07:09,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:09,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:09,064 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:09,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:09,065 INFO L82 PathProgramCache]: Analyzing trace with hash -564593784, now seen corresponding path program 1 times [2019-11-07 01:07:09,065 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:09,065 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642844005] [2019-11-07 01:07:09,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:09,499 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642844005] [2019-11-07 01:07:09,499 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:09,499 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 01:07:09,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868736709] [2019-11-07 01:07:09,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 01:07:09,500 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:09,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 01:07:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-07 01:07:09,501 INFO L87 Difference]: Start difference. First operand 3558 states and 5350 transitions. Second operand 13 states. [2019-11-07 01:07:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:13,834 INFO L93 Difference]: Finished difference Result 18347 states and 28459 transitions. [2019-11-07 01:07:13,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-07 01:07:13,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 157 [2019-11-07 01:07:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:13,900 INFO L225 Difference]: With dead ends: 18347 [2019-11-07 01:07:13,900 INFO L226 Difference]: Without dead ends: 15008 [2019-11-07 01:07:13,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-11-07 01:07:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15008 states. [2019-11-07 01:07:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15008 to 9082. [2019-11-07 01:07:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9082 states. [2019-11-07 01:07:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9082 states to 9082 states and 13835 transitions. [2019-11-07 01:07:14,509 INFO L78 Accepts]: Start accepts. Automaton has 9082 states and 13835 transitions. Word has length 157 [2019-11-07 01:07:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:14,509 INFO L462 AbstractCegarLoop]: Abstraction has 9082 states and 13835 transitions. [2019-11-07 01:07:14,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 01:07:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 9082 states and 13835 transitions. [2019-11-07 01:07:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:07:14,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:14,518 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:14,519 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash -253521854, now seen corresponding path program 1 times [2019-11-07 01:07:14,519 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:14,520 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197248868] [2019-11-07 01:07:14,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:14,911 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197248868] [2019-11-07 01:07:14,912 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:14,912 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:07:14,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67846061] [2019-11-07 01:07:14,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:07:14,914 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:14,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:07:14,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:14,915 INFO L87 Difference]: Start difference. First operand 9082 states and 13835 transitions. Second operand 9 states. [2019-11-07 01:07:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:15,838 INFO L93 Difference]: Finished difference Result 12850 states and 19769 transitions. [2019-11-07 01:07:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:07:15,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-11-07 01:07:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:15,849 INFO L225 Difference]: With dead ends: 12850 [2019-11-07 01:07:15,850 INFO L226 Difference]: Without dead ends: 4668 [2019-11-07 01:07:15,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:07:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-11-07 01:07:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 3558. [2019-11-07 01:07:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2019-11-07 01:07:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5335 transitions. [2019-11-07 01:07:16,048 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5335 transitions. Word has length 157 [2019-11-07 01:07:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:16,048 INFO L462 AbstractCegarLoop]: Abstraction has 3558 states and 5335 transitions. [2019-11-07 01:07:16,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:07:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5335 transitions. [2019-11-07 01:07:16,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:07:16,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:16,054 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:16,054 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1981028429, now seen corresponding path program 1 times [2019-11-07 01:07:16,055 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:16,055 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604662410] [2019-11-07 01:07:16,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:16,309 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604662410] [2019-11-07 01:07:16,310 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:16,310 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:07:16,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14285746] [2019-11-07 01:07:16,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:07:16,312 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:16,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:07:16,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:07:16,312 INFO L87 Difference]: Start difference. First operand 3558 states and 5335 transitions. Second operand 9 states. [2019-11-07 01:07:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:18,101 INFO L93 Difference]: Finished difference Result 16721 states and 25805 transitions. [2019-11-07 01:07:18,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 01:07:18,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-11-07 01:07:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:18,132 INFO L225 Difference]: With dead ends: 16721 [2019-11-07 01:07:18,133 INFO L226 Difference]: Without dead ends: 13382 [2019-11-07 01:07:18,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-11-07 01:07:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2019-11-07 01:07:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 8886. [2019-11-07 01:07:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8886 states. [2019-11-07 01:07:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 13413 transitions. [2019-11-07 01:07:18,597 INFO L78 Accepts]: Start accepts. Automaton has 8886 states and 13413 transitions. Word has length 157 [2019-11-07 01:07:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:18,598 INFO L462 AbstractCegarLoop]: Abstraction has 8886 states and 13413 transitions. [2019-11-07 01:07:18,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:07:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 8886 states and 13413 transitions. [2019-11-07 01:07:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:07:18,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:18,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:18,605 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:18,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2002866937, now seen corresponding path program 1 times [2019-11-07 01:07:18,606 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:18,606 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260951842] [2019-11-07 01:07:18,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:18,768 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260951842] [2019-11-07 01:07:18,768 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:18,769 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:18,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192890357] [2019-11-07 01:07:18,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:18,770 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:18,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:18,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:18,770 INFO L87 Difference]: Start difference. First operand 8886 states and 13413 transitions. Second operand 4 states. [2019-11-07 01:07:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:19,342 INFO L93 Difference]: Finished difference Result 16603 states and 25814 transitions. [2019-11-07 01:07:19,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:19,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-07 01:07:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:19,363 INFO L225 Difference]: With dead ends: 16603 [2019-11-07 01:07:19,364 INFO L226 Difference]: Without dead ends: 10662 [2019-11-07 01:07:19,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10662 states. [2019-11-07 01:07:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10662 to 10660. [2019-11-07 01:07:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10660 states. [2019-11-07 01:07:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10660 states to 10660 states and 16201 transitions. [2019-11-07 01:07:20,436 INFO L78 Accepts]: Start accepts. Automaton has 10660 states and 16201 transitions. Word has length 157 [2019-11-07 01:07:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:20,437 INFO L462 AbstractCegarLoop]: Abstraction has 10660 states and 16201 transitions. [2019-11-07 01:07:20,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 10660 states and 16201 transitions. [2019-11-07 01:07:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:07:20,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:20,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:20,445 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:20,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:20,446 INFO L82 PathProgramCache]: Analyzing trace with hash -286073469, now seen corresponding path program 1 times [2019-11-07 01:07:20,446 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:20,446 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090120509] [2019-11-07 01:07:20,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:20,638 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090120509] [2019-11-07 01:07:20,638 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:20,639 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:20,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958295609] [2019-11-07 01:07:20,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:20,639 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:20,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:20,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:20,640 INFO L87 Difference]: Start difference. First operand 10660 states and 16201 transitions. Second operand 4 states. [2019-11-07 01:07:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:21,613 INFO L93 Difference]: Finished difference Result 28048 states and 42570 transitions. [2019-11-07 01:07:21,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:21,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-07 01:07:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:21,644 INFO L225 Difference]: With dead ends: 28048 [2019-11-07 01:07:21,644 INFO L226 Difference]: Without dead ends: 17411 [2019-11-07 01:07:21,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17411 states. [2019-11-07 01:07:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17411 to 17377. [2019-11-07 01:07:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2019-11-07 01:07:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 26114 transitions. [2019-11-07 01:07:22,671 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 26114 transitions. Word has length 157 [2019-11-07 01:07:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:22,671 INFO L462 AbstractCegarLoop]: Abstraction has 17377 states and 26114 transitions. [2019-11-07 01:07:22,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 26114 transitions. [2019-11-07 01:07:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:07:22,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:22,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:22,680 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:22,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1553675807, now seen corresponding path program 1 times [2019-11-07 01:07:22,680 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:22,681 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257665695] [2019-11-07 01:07:22,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:22,786 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257665695] [2019-11-07 01:07:22,786 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:22,787 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:22,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142975460] [2019-11-07 01:07:22,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:22,787 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:22,788 INFO L87 Difference]: Start difference. First operand 17377 states and 26114 transitions. Second operand 3 states. [2019-11-07 01:07:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:24,282 INFO L93 Difference]: Finished difference Result 46780 states and 70277 transitions. [2019-11-07 01:07:24,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:24,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-07 01:07:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:24,331 INFO L225 Difference]: With dead ends: 46780 [2019-11-07 01:07:24,331 INFO L226 Difference]: Without dead ends: 29799 [2019-11-07 01:07:24,384 INFO L630 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-11-07 01:07:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29799 states. [2019-11-07 01:07:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29799 to 29769. [2019-11-07 01:07:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29769 states. [2019-11-07 01:07:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29769 states to 29769 states and 44199 transitions. [2019-11-07 01:07:26,650 INFO L78 Accepts]: Start accepts. Automaton has 29769 states and 44199 transitions. Word has length 159 [2019-11-07 01:07:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:26,651 INFO L462 AbstractCegarLoop]: Abstraction has 29769 states and 44199 transitions. [2019-11-07 01:07:26,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29769 states and 44199 transitions. [2019-11-07 01:07:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-07 01:07:26,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:26,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:26,662 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:26,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2132469410, now seen corresponding path program 1 times [2019-11-07 01:07:26,662 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:26,662 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938511635] [2019-11-07 01:07:26,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:26,919 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938511635] [2019-11-07 01:07:26,919 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:26,919 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:26,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474580638] [2019-11-07 01:07:26,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:26,920 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:26,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:26,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:26,921 INFO L87 Difference]: Start difference. First operand 29769 states and 44199 transitions. Second operand 4 states. [2019-11-07 01:07:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:28,293 INFO L93 Difference]: Finished difference Result 50148 states and 74433 transitions. [2019-11-07 01:07:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:28,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-07 01:07:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:28,317 INFO L225 Difference]: With dead ends: 50148 [2019-11-07 01:07:28,317 INFO L226 Difference]: Without dead ends: 27144 [2019-11-07 01:07:28,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:07:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27144 states. [2019-11-07 01:07:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27144 to 27144. [2019-11-07 01:07:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27144 states. [2019-11-07 01:07:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27144 states to 27144 states and 40307 transitions. [2019-11-07 01:07:29,637 INFO L78 Accepts]: Start accepts. Automaton has 27144 states and 40307 transitions. Word has length 159 [2019-11-07 01:07:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:29,637 INFO L462 AbstractCegarLoop]: Abstraction has 27144 states and 40307 transitions. [2019-11-07 01:07:29,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 27144 states and 40307 transitions. [2019-11-07 01:07:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-07 01:07:29,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:29,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:29,648 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:29,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:29,648 INFO L82 PathProgramCache]: Analyzing trace with hash 642084846, now seen corresponding path program 1 times [2019-11-07 01:07:29,648 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:29,649 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767405693] [2019-11-07 01:07:29,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:29,855 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767405693] [2019-11-07 01:07:29,855 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:29,855 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:29,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284740761] [2019-11-07 01:07:29,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:29,856 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:29,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:29,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:29,857 INFO L87 Difference]: Start difference. First operand 27144 states and 40307 transitions. Second operand 3 states. [2019-11-07 01:07:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:32,562 INFO L93 Difference]: Finished difference Result 72226 states and 108579 transitions. [2019-11-07 01:07:32,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:32,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-07 01:07:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:32,611 INFO L225 Difference]: With dead ends: 72226 [2019-11-07 01:07:32,612 INFO L226 Difference]: Without dead ends: 45418 [2019-11-07 01:07:32,644 INFO L630 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-11-07 01:07:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45418 states.