/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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:06:22,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:22,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:22,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:22,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:22,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:22,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:22,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:22,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:22,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:22,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:22,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:22,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:23,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:23,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:23,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:23,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:23,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:23,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:23,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:23,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:23,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:23,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:23,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:23,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:23,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:23,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:23,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:23,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:23,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:23,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:23,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:23,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:23,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:23,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:23,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:23,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:23,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:23,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:23,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:23,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:23,026 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:23,039 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:23,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:23,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:23,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:23,041 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:23,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:23,042 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:23,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:23,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:23,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:23,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:23,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:23,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:23,043 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:23,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:23,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:23,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:23,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:23,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:23,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:23,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:23,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:23,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:23,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:23,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:23,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:23,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:23,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:23,046 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:23,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:06:23,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:06:23,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:06:23,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:06:23,332 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:06:23,333 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:06:23,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/378dcc982/565d4aafe8f6462cac3296f9832b18a6/FLAGe46094c1f [2019-11-07 01:06:23,954 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:06:23,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:06:23,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/378dcc982/565d4aafe8f6462cac3296f9832b18a6/FLAGe46094c1f [2019-11-07 01:06:24,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/378dcc982/565d4aafe8f6462cac3296f9832b18a6 [2019-11-07 01:06:24,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:06:24,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:06:24,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:24,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:06:24,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:06:24,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:24" (1/1) ... [2019-11-07 01:06:24,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f80dda0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:24, skipping insertion in model container [2019-11-07 01:06:24,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:24" (1/1) ... [2019-11-07 01:06:24,261 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:06:24,335 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:06:24,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:24,883 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:06:25,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:25,040 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:06:25,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25 WrapperNode [2019-11-07 01:06:25,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:25,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:06:25,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:06:25,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:06:25,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... [2019-11-07 01:06:25,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:06:25,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:06:25,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:06:25,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:06:25,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:25,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:06:25,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:06:25,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:06:25,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:06:25,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:06:25,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:06:25,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:06:25,223 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:06:25,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:06:25,224 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:06:25,224 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:06:25,224 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:06:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:06:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:06:25,226 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:06:25,226 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:06:25,228 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:06:25,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:06:25,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:06:26,409 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:06:26,410 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:06:26,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:26 BoogieIcfgContainer [2019-11-07 01:06:26,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:06:26,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:06:26,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:06:26,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:06:26,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:24" (1/3) ... [2019-11-07 01:06:26,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2aff05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:26, skipping insertion in model container [2019-11-07 01:06:26,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:25" (2/3) ... [2019-11-07 01:06:26,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2aff05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:26, skipping insertion in model container [2019-11-07 01:06:26,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:26" (3/3) ... [2019-11-07 01:06:26,420 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:06:26,429 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:06:26,457 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-07 01:06:26,471 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-07 01:06:26,498 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:06:26,498 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:06:26,499 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:06:26,499 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:06:26,499 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:06:26,499 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:06:26,499 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:06:26,500 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:06:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2019-11-07 01:06:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-07 01:06:26,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:26,537 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] [2019-11-07 01:06:26,538 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash -907914047, now seen corresponding path program 1 times [2019-11-07 01:06:26,550 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:26,551 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709243906] [2019-11-07 01:06:26,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:27,248 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:06:27,249 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709243906] [2019-11-07 01:06:27,250 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:27,250 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:27,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157281392] [2019-11-07 01:06:27,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:27,261 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:27,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:27,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:27,279 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 4 states. [2019-11-07 01:06:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:27,523 INFO L93 Difference]: Finished difference Result 789 states and 1385 transitions. [2019-11-07 01:06:27,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:27,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-07 01:06:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:27,546 INFO L225 Difference]: With dead ends: 789 [2019-11-07 01:06:27,546 INFO L226 Difference]: Without dead ends: 519 [2019-11-07 01:06:27,553 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:06:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-11-07 01:06:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 496. [2019-11-07 01:06:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-07 01:06:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 722 transitions. [2019-11-07 01:06:27,712 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 722 transitions. Word has length 102 [2019-11-07 01:06:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:27,713 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 722 transitions. [2019-11-07 01:06:27,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 722 transitions. [2019-11-07 01:06:27,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-07 01:06:27,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:27,723 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] [2019-11-07 01:06:27,724 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:27,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1093362695, now seen corresponding path program 1 times [2019-11-07 01:06:27,725 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:27,725 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249271209] [2019-11-07 01:06:27,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:27,912 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:06:27,913 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249271209] [2019-11-07 01:06:27,913 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:27,913 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:27,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979912152] [2019-11-07 01:06:27,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:27,915 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:27,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:27,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:27,916 INFO L87 Difference]: Start difference. First operand 496 states and 722 transitions. Second operand 3 states. [2019-11-07 01:06:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:27,970 INFO L93 Difference]: Finished difference Result 1442 states and 2096 transitions. [2019-11-07 01:06:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:27,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-07 01:06:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:27,976 INFO L225 Difference]: With dead ends: 1442 [2019-11-07 01:06:27,976 INFO L226 Difference]: Without dead ends: 978 [2019-11-07 01:06:27,979 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:06:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-07 01:06:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 498. [2019-11-07 01:06:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-11-07 01:06:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 724 transitions. [2019-11-07 01:06:28,007 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 724 transitions. Word has length 103 [2019-11-07 01:06:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:28,007 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 724 transitions. [2019-11-07 01:06:28,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 724 transitions. [2019-11-07 01:06:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 01:06:28,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:28,010 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] [2019-11-07 01:06:28,010 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1521321784, now seen corresponding path program 1 times [2019-11-07 01:06:28,011 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:28,011 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555837550] [2019-11-07 01:06:28,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:28,106 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:06:28,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555837550] [2019-11-07 01:06:28,107 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:28,107 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:28,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11206596] [2019-11-07 01:06:28,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:28,111 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:28,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:28,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:28,115 INFO L87 Difference]: Start difference. First operand 498 states and 724 transitions. Second operand 3 states. [2019-11-07 01:06:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:28,186 INFO L93 Difference]: Finished difference Result 1029 states and 1554 transitions. [2019-11-07 01:06:28,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:28,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-07 01:06:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:28,192 INFO L225 Difference]: With dead ends: 1029 [2019-11-07 01:06:28,194 INFO L226 Difference]: Without dead ends: 662 [2019-11-07 01:06:28,197 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:06:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-07 01:06:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 646. [2019-11-07 01:06:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-11-07 01:06:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 968 transitions. [2019-11-07 01:06:28,235 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 968 transitions. Word has length 104 [2019-11-07 01:06:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:28,236 INFO L462 AbstractCegarLoop]: Abstraction has 646 states and 968 transitions. [2019-11-07 01:06:28,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 968 transitions. [2019-11-07 01:06:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 01:06:28,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:28,238 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] [2019-11-07 01:06:28,238 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:28,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:28,239 INFO L82 PathProgramCache]: Analyzing trace with hash 60289518, now seen corresponding path program 1 times [2019-11-07 01:06:28,240 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:28,240 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129805102] [2019-11-07 01:06:28,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:28,381 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:06:28,381 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129805102] [2019-11-07 01:06:28,382 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:28,382 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:28,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203381779] [2019-11-07 01:06:28,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:28,384 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:28,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:28,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:28,384 INFO L87 Difference]: Start difference. First operand 646 states and 968 transitions. Second operand 3 states. [2019-11-07 01:06:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:28,492 INFO L93 Difference]: Finished difference Result 1690 states and 2556 transitions. [2019-11-07 01:06:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:28,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-07 01:06:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:28,503 INFO L225 Difference]: With dead ends: 1690 [2019-11-07 01:06:28,503 INFO L226 Difference]: Without dead ends: 1241 [2019-11-07 01:06:28,504 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:06:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-11-07 01:06:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1220. [2019-11-07 01:06:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2019-11-07 01:06:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1820 transitions. [2019-11-07 01:06:28,565 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1820 transitions. Word has length 104 [2019-11-07 01:06:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:28,566 INFO L462 AbstractCegarLoop]: Abstraction has 1220 states and 1820 transitions. [2019-11-07 01:06:28,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1820 transitions. [2019-11-07 01:06:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 01:06:28,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:28,568 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] [2019-11-07 01:06:28,569 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1524807285, now seen corresponding path program 1 times [2019-11-07 01:06:28,569 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:28,570 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931159029] [2019-11-07 01:06:28,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:28,760 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:06:28,761 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931159029] [2019-11-07 01:06:28,761 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:28,761 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:28,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474675846] [2019-11-07 01:06:28,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:28,762 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:28,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:28,764 INFO L87 Difference]: Start difference. First operand 1220 states and 1820 transitions. Second operand 4 states. [2019-11-07 01:06:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:28,855 INFO L93 Difference]: Finished difference Result 1973 states and 2965 transitions. [2019-11-07 01:06:28,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:28,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-07 01:06:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:28,860 INFO L225 Difference]: With dead ends: 1973 [2019-11-07 01:06:28,861 INFO L226 Difference]: Without dead ends: 938 [2019-11-07 01:06:28,863 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:06:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-11-07 01:06:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2019-11-07 01:06:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-11-07 01:06:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1391 transitions. [2019-11-07 01:06:28,917 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1391 transitions. Word has length 104 [2019-11-07 01:06:28,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:28,918 INFO L462 AbstractCegarLoop]: Abstraction has 938 states and 1391 transitions. [2019-11-07 01:06:28,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1391 transitions. [2019-11-07 01:06:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 01:06:28,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:28,920 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] [2019-11-07 01:06:28,921 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash 431033542, now seen corresponding path program 1 times [2019-11-07 01:06:28,921 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:28,922 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263425111] [2019-11-07 01:06:28,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:29,072 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:06:29,072 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263425111] [2019-11-07 01:06:29,073 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:29,074 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:29,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708012813] [2019-11-07 01:06:29,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:29,075 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:29,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:29,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:29,075 INFO L87 Difference]: Start difference. First operand 938 states and 1391 transitions. Second operand 3 states. [2019-11-07 01:06:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:29,214 INFO L93 Difference]: Finished difference Result 2034 states and 3133 transitions. [2019-11-07 01:06:29,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:29,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-07 01:06:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:29,224 INFO L225 Difference]: With dead ends: 2034 [2019-11-07 01:06:29,225 INFO L226 Difference]: Without dead ends: 1366 [2019-11-07 01:06:29,227 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:06:29,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-11-07 01:06:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1322. [2019-11-07 01:06:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-11-07 01:06:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2014 transitions. [2019-11-07 01:06:29,340 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2014 transitions. Word has length 106 [2019-11-07 01:06:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:29,342 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 2014 transitions. [2019-11-07 01:06:29,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2014 transitions. [2019-11-07 01:06:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-07 01:06:29,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:29,349 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] [2019-11-07 01:06:29,349 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1740408399, now seen corresponding path program 1 times [2019-11-07 01:06:29,359 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:29,359 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828890716] [2019-11-07 01:06:29,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:29,633 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:06:29,634 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828890716] [2019-11-07 01:06:29,634 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:29,634 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:29,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308319811] [2019-11-07 01:06:29,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:29,635 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:29,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:29,636 INFO L87 Difference]: Start difference. First operand 1322 states and 2014 transitions. Second operand 4 states. [2019-11-07 01:06:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:29,861 INFO L93 Difference]: Finished difference Result 3366 states and 5138 transitions. [2019-11-07 01:06:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:29,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-07 01:06:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:29,871 INFO L225 Difference]: With dead ends: 3366 [2019-11-07 01:06:29,871 INFO L226 Difference]: Without dead ends: 2067 [2019-11-07 01:06:29,876 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:06:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-11-07 01:06:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2052. [2019-11-07 01:06:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-11-07 01:06:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3114 transitions. [2019-11-07 01:06:30,024 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3114 transitions. Word has length 107 [2019-11-07 01:06:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:30,025 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 3114 transitions. [2019-11-07 01:06:30,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:30,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3114 transitions. [2019-11-07 01:06:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-07 01:06:30,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:30,029 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] [2019-11-07 01:06:30,029 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash -481916784, now seen corresponding path program 1 times [2019-11-07 01:06:30,030 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:30,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656541751] [2019-11-07 01:06:30,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:30,149 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:06:30,150 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656541751] [2019-11-07 01:06:30,150 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:30,150 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:30,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815694488] [2019-11-07 01:06:30,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:30,151 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:30,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:30,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:30,152 INFO L87 Difference]: Start difference. First operand 2052 states and 3114 transitions. Second operand 3 states. [2019-11-07 01:06:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:30,401 INFO L93 Difference]: Finished difference Result 5515 states and 8477 transitions. [2019-11-07 01:06:30,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:30,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-07 01:06:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:30,423 INFO L225 Difference]: With dead ends: 5515 [2019-11-07 01:06:30,423 INFO L226 Difference]: Without dead ends: 3822 [2019-11-07 01:06:30,430 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:06:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2019-11-07 01:06:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3809. [2019-11-07 01:06:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2019-11-07 01:06:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 5773 transitions. [2019-11-07 01:06:30,793 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 5773 transitions. Word has length 109 [2019-11-07 01:06:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:30,794 INFO L462 AbstractCegarLoop]: Abstraction has 3809 states and 5773 transitions. [2019-11-07 01:06:30,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 5773 transitions. [2019-11-07 01:06:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-07 01:06:30,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:30,797 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] [2019-11-07 01:06:30,797 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:30,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:30,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1064644563, now seen corresponding path program 1 times [2019-11-07 01:06:30,798 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:30,798 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91929903] [2019-11-07 01:06:30,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:30,941 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:06:30,942 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91929903] [2019-11-07 01:06:30,942 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:30,943 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:30,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145563809] [2019-11-07 01:06:30,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:30,944 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:30,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:30,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:30,945 INFO L87 Difference]: Start difference. First operand 3809 states and 5773 transitions. Second operand 4 states. [2019-11-07 01:06:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:31,150 INFO L93 Difference]: Finished difference Result 5943 states and 9044 transitions. [2019-11-07 01:06:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:31,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-07 01:06:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:31,165 INFO L225 Difference]: With dead ends: 5943 [2019-11-07 01:06:31,165 INFO L226 Difference]: Without dead ends: 3112 [2019-11-07 01:06:31,174 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:06:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2019-11-07 01:06:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 3112. [2019-11-07 01:06:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2019-11-07 01:06:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4697 transitions. [2019-11-07 01:06:31,410 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4697 transitions. Word has length 109 [2019-11-07 01:06:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:31,411 INFO L462 AbstractCegarLoop]: Abstraction has 3112 states and 4697 transitions. [2019-11-07 01:06:31,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:31,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4697 transitions. [2019-11-07 01:06:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-07 01:06:31,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:31,414 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] [2019-11-07 01:06:31,414 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash 894991708, now seen corresponding path program 1 times [2019-11-07 01:06:31,415 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:31,415 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110872733] [2019-11-07 01:06:31,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:31,515 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:06:31,515 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110872733] [2019-11-07 01:06:31,516 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:31,516 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:31,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840387913] [2019-11-07 01:06:31,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:31,518 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:31,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:31,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:31,519 INFO L87 Difference]: Start difference. First operand 3112 states and 4697 transitions. Second operand 3 states. [2019-11-07 01:06:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:31,815 INFO L93 Difference]: Finished difference Result 7812 states and 12106 transitions. [2019-11-07 01:06:31,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:31,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-07 01:06:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:31,842 INFO L225 Difference]: With dead ends: 7812 [2019-11-07 01:06:31,842 INFO L226 Difference]: Without dead ends: 5036 [2019-11-07 01:06:31,854 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:06:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-11-07 01:06:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4830. [2019-11-07 01:06:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4830 states. [2019-11-07 01:06:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 7460 transitions. [2019-11-07 01:06:32,169 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 7460 transitions. Word has length 111 [2019-11-07 01:06:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:32,169 INFO L462 AbstractCegarLoop]: Abstraction has 4830 states and 7460 transitions. [2019-11-07 01:06:32,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 7460 transitions. [2019-11-07 01:06:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-07 01:06:32,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:32,173 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] [2019-11-07 01:06:32,173 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:32,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:32,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1533697134, now seen corresponding path program 1 times [2019-11-07 01:06:32,173 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:32,174 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136868094] [2019-11-07 01:06:32,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:32,234 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:06:32,234 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136868094] [2019-11-07 01:06:32,235 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:32,235 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:32,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899388599] [2019-11-07 01:06:32,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:32,236 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:32,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:32,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:32,236 INFO L87 Difference]: Start difference. First operand 4830 states and 7460 transitions. Second operand 3 states. [2019-11-07 01:06:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:32,880 INFO L93 Difference]: Finished difference Result 13617 states and 21279 transitions. [2019-11-07 01:06:32,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:32,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-07 01:06:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:32,935 INFO L225 Difference]: With dead ends: 13617 [2019-11-07 01:06:32,936 INFO L226 Difference]: Without dead ends: 9347 [2019-11-07 01:06:32,945 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:06:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9347 states. [2019-11-07 01:06:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9347 to 9275. [2019-11-07 01:06:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9275 states. [2019-11-07 01:06:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9275 states to 9275 states and 14366 transitions. [2019-11-07 01:06:33,556 INFO L78 Accepts]: Start accepts. Automaton has 9275 states and 14366 transitions. Word has length 112 [2019-11-07 01:06:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:33,557 INFO L462 AbstractCegarLoop]: Abstraction has 9275 states and 14366 transitions. [2019-11-07 01:06:33,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 9275 states and 14366 transitions. [2019-11-07 01:06:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-07 01:06:33,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:33,564 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] [2019-11-07 01:06:33,565 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:33,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1051932183, now seen corresponding path program 1 times [2019-11-07 01:06:33,565 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:33,566 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683126135] [2019-11-07 01:06:33,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:33,738 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:06:33,739 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683126135] [2019-11-07 01:06:33,739 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:33,739 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:33,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467653061] [2019-11-07 01:06:33,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:33,740 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:33,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:33,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:33,741 INFO L87 Difference]: Start difference. First operand 9275 states and 14366 transitions. Second operand 4 states. [2019-11-07 01:06:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:34,652 INFO L93 Difference]: Finished difference Result 25948 states and 40113 transitions. [2019-11-07 01:06:34,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:34,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-07 01:06:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:34,701 INFO L225 Difference]: With dead ends: 25948 [2019-11-07 01:06:34,701 INFO L226 Difference]: Without dead ends: 16716 [2019-11-07 01:06:34,722 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:06:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16716 states. [2019-11-07 01:06:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16716 to 16644. [2019-11-07 01:06:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16644 states. [2019-11-07 01:06:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16644 states to 16644 states and 25497 transitions. [2019-11-07 01:06:35,657 INFO L78 Accepts]: Start accepts. Automaton has 16644 states and 25497 transitions. Word has length 112 [2019-11-07 01:06:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:35,657 INFO L462 AbstractCegarLoop]: Abstraction has 16644 states and 25497 transitions. [2019-11-07 01:06:35,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 16644 states and 25497 transitions. [2019-11-07 01:06:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-07 01:06:35,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:35,665 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] [2019-11-07 01:06:35,665 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1424445537, now seen corresponding path program 1 times [2019-11-07 01:06:35,666 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:35,666 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180169113] [2019-11-07 01:06:35,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:35,723 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:06:35,724 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180169113] [2019-11-07 01:06:35,724 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:35,724 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:35,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203254362] [2019-11-07 01:06:35,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:35,725 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:35,726 INFO L87 Difference]: Start difference. First operand 16644 states and 25497 transitions. Second operand 3 states. [2019-11-07 01:06:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:37,560 INFO L93 Difference]: Finished difference Result 49726 states and 76228 transitions. [2019-11-07 01:06:37,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:37,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-07 01:06:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:37,640 INFO L225 Difference]: With dead ends: 49726 [2019-11-07 01:06:37,640 INFO L226 Difference]: Without dead ends: 33194 [2019-11-07 01:06:37,673 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:06:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33194 states. [2019-11-07 01:06:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33194 to 16650. [2019-11-07 01:06:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16650 states. [2019-11-07 01:06:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16650 states to 16650 states and 25503 transitions. [2019-11-07 01:06:38,671 INFO L78 Accepts]: Start accepts. Automaton has 16650 states and 25503 transitions. Word has length 113 [2019-11-07 01:06:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:38,671 INFO L462 AbstractCegarLoop]: Abstraction has 16650 states and 25503 transitions. [2019-11-07 01:06:38,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 16650 states and 25503 transitions. [2019-11-07 01:06:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:06:38,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:38,676 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] [2019-11-07 01:06:38,677 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash 274337368, now seen corresponding path program 1 times [2019-11-07 01:06:38,677 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:38,677 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306551599] [2019-11-07 01:06:38,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:38,800 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306551599] [2019-11-07 01:06:38,800 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:38,800 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:38,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868542511] [2019-11-07 01:06:38,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:38,801 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:38,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:38,801 INFO L87 Difference]: Start difference. First operand 16650 states and 25503 transitions. Second operand 4 states. [2019-11-07 01:06:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:39,531 INFO L93 Difference]: Finished difference Result 33186 states and 50861 transitions. [2019-11-07 01:06:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:39,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-07 01:06:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:39,577 INFO L225 Difference]: With dead ends: 33186 [2019-11-07 01:06:39,577 INFO L226 Difference]: Without dead ends: 16650 [2019-11-07 01:06:39,611 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:06:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16650 states. [2019-11-07 01:06:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16650 to 16647. [2019-11-07 01:06:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16647 states. [2019-11-07 01:06:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16647 states to 16647 states and 25496 transitions. [2019-11-07 01:06:40,428 INFO L78 Accepts]: Start accepts. Automaton has 16647 states and 25496 transitions. Word has length 114 [2019-11-07 01:06:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:40,428 INFO L462 AbstractCegarLoop]: Abstraction has 16647 states and 25496 transitions. [2019-11-07 01:06:40,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 16647 states and 25496 transitions. [2019-11-07 01:06:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:06:40,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:40,435 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] [2019-11-07 01:06:40,436 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:40,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1558735045, now seen corresponding path program 1 times [2019-11-07 01:06:40,436 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:40,437 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441774873] [2019-11-07 01:06:40,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:40,669 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:06:40,670 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441774873] [2019-11-07 01:06:40,670 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:40,670 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:40,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619850300] [2019-11-07 01:06:40,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:40,671 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:40,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:40,672 INFO L87 Difference]: Start difference. First operand 16647 states and 25496 transitions. Second operand 4 states. [2019-11-07 01:06:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:41,523 INFO L93 Difference]: Finished difference Result 33251 states and 50933 transitions. [2019-11-07 01:06:41,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:41,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-07 01:06:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:41,557 INFO L225 Difference]: With dead ends: 33251 [2019-11-07 01:06:41,557 INFO L226 Difference]: Without dead ends: 16641 [2019-11-07 01:06:41,583 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:06:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16641 states. [2019-11-07 01:06:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16641 to 16641. [2019-11-07 01:06:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16641 states. [2019-11-07 01:06:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16641 states to 16641 states and 25484 transitions. [2019-11-07 01:06:42,556 INFO L78 Accepts]: Start accepts. Automaton has 16641 states and 25484 transitions. Word has length 114 [2019-11-07 01:06:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:42,556 INFO L462 AbstractCegarLoop]: Abstraction has 16641 states and 25484 transitions. [2019-11-07 01:06:42,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 16641 states and 25484 transitions. [2019-11-07 01:06:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 01:06:42,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:42,562 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] [2019-11-07 01:06:42,562 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:42,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:42,562 INFO L82 PathProgramCache]: Analyzing trace with hash 63830760, now seen corresponding path program 1 times [2019-11-07 01:06:42,563 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:42,563 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716001087] [2019-11-07 01:06:42,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:42,641 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:06:42,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716001087] [2019-11-07 01:06:42,642 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:42,642 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:42,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246370337] [2019-11-07 01:06:42,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:42,643 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:42,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:42,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:42,644 INFO L87 Difference]: Start difference. First operand 16641 states and 25484 transitions. Second operand 3 states. [2019-11-07 01:06:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:44,338 INFO L93 Difference]: Finished difference Result 39717 states and 60974 transitions. [2019-11-07 01:06:44,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:44,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-07 01:06:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:44,367 INFO L225 Difference]: With dead ends: 39717 [2019-11-07 01:06:44,367 INFO L226 Difference]: Without dead ends: 24107 [2019-11-07 01:06:44,385 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:06:44,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24107 states. [2019-11-07 01:06:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24107 to 24035. [2019-11-07 01:06:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24035 states. [2019-11-07 01:06:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 36262 transitions. [2019-11-07 01:06:45,316 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 36262 transitions. Word has length 114 [2019-11-07 01:06:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:45,316 INFO L462 AbstractCegarLoop]: Abstraction has 24035 states and 36262 transitions. [2019-11-07 01:06:45,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 36262 transitions. [2019-11-07 01:06:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-07 01:06:45,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:45,324 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] [2019-11-07 01:06:45,324 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash 437096993, now seen corresponding path program 1 times [2019-11-07 01:06:45,325 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:45,325 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843348648] [2019-11-07 01:06:45,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:45,549 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:06:45,549 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843348648] [2019-11-07 01:06:45,550 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:45,550 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:45,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952292297] [2019-11-07 01:06:45,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:45,551 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:45,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:45,551 INFO L87 Difference]: Start difference. First operand 24035 states and 36262 transitions. Second operand 4 states. [2019-11-07 01:06:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:46,497 INFO L93 Difference]: Finished difference Result 39430 states and 59625 transitions. [2019-11-07 01:06:46,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:46,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-07 01:06:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:46,536 INFO L225 Difference]: With dead ends: 39430 [2019-11-07 01:06:46,536 INFO L226 Difference]: Without dead ends: 22327 [2019-11-07 01:06:46,557 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:06:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22327 states. [2019-11-07 01:06:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22327 to 22237. [2019-11-07 01:06:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22237 states. [2019-11-07 01:06:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22237 states to 22237 states and 33524 transitions. [2019-11-07 01:06:47,670 INFO L78 Accepts]: Start accepts. Automaton has 22237 states and 33524 transitions. Word has length 117 [2019-11-07 01:06:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:47,670 INFO L462 AbstractCegarLoop]: Abstraction has 22237 states and 33524 transitions. [2019-11-07 01:06:47,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 22237 states and 33524 transitions. [2019-11-07 01:06:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-07 01:06:47,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:47,676 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] [2019-11-07 01:06:47,676 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:47,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:47,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1129378256, now seen corresponding path program 1 times [2019-11-07 01:06:47,677 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:47,677 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889259285] [2019-11-07 01:06:47,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:47,801 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:06:47,802 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889259285] [2019-11-07 01:06:47,802 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:47,802 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:47,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233001353] [2019-11-07 01:06:47,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:47,803 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:47,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:47,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:47,804 INFO L87 Difference]: Start difference. First operand 22237 states and 33524 transitions. Second operand 4 states. [2019-11-07 01:06:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:48,960 INFO L93 Difference]: Finished difference Result 44667 states and 67298 transitions. [2019-11-07 01:06:48,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:48,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-07 01:06:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:48,985 INFO L225 Difference]: With dead ends: 44667 [2019-11-07 01:06:48,985 INFO L226 Difference]: Without dead ends: 22589 [2019-11-07 01:06:49,002 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:06:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22589 states. [2019-11-07 01:06:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22589 to 22397. [2019-11-07 01:06:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22397 states. [2019-11-07 01:06:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22397 states to 22397 states and 33699 transitions. [2019-11-07 01:06:49,910 INFO L78 Accepts]: Start accepts. Automaton has 22397 states and 33699 transitions. Word has length 119 [2019-11-07 01:06:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:49,910 INFO L462 AbstractCegarLoop]: Abstraction has 22397 states and 33699 transitions. [2019-11-07 01:06:49,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 22397 states and 33699 transitions. [2019-11-07 01:06:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:06:49,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:49,915 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] [2019-11-07 01:06:49,916 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:49,916 INFO L82 PathProgramCache]: Analyzing trace with hash -586953148, now seen corresponding path program 1 times [2019-11-07 01:06:49,916 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:49,916 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548885283] [2019-11-07 01:06:49,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:49,968 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:06:49,969 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548885283] [2019-11-07 01:06:49,969 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:49,969 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:49,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046504755] [2019-11-07 01:06:49,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:49,970 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:49,970 INFO L87 Difference]: Start difference. First operand 22397 states and 33699 transitions. Second operand 3 states. [2019-11-07 01:06:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:51,803 INFO L93 Difference]: Finished difference Result 60771 states and 91685 transitions. [2019-11-07 01:06:51,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:51,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-07 01:06:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:51,857 INFO L225 Difference]: With dead ends: 60771 [2019-11-07 01:06:51,857 INFO L226 Difference]: Without dead ends: 44583 [2019-11-07 01:06:51,877 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:06:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44583 states. [2019-11-07 01:06:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44583 to 22407. [2019-11-07 01:06:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22407 states. [2019-11-07 01:06:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22407 states to 22407 states and 33709 transitions. [2019-11-07 01:06:53,834 INFO L78 Accepts]: Start accepts. Automaton has 22407 states and 33709 transitions. Word has length 120 [2019-11-07 01:06:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:53,834 INFO L462 AbstractCegarLoop]: Abstraction has 22407 states and 33709 transitions. [2019-11-07 01:06:53,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22407 states and 33709 transitions. [2019-11-07 01:06:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-07 01:06:53,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:53,838 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] [2019-11-07 01:06:53,839 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1913512932, now seen corresponding path program 1 times [2019-11-07 01:06:53,839 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:53,839 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029487691] [2019-11-07 01:06:53,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:53,941 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:06:53,942 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029487691] [2019-11-07 01:06:53,942 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:53,942 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:06:53,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886672971] [2019-11-07 01:06:53,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:53,943 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:53,943 INFO L87 Difference]: Start difference. First operand 22407 states and 33709 transitions. Second operand 5 states. [2019-11-07 01:06:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:55,469 INFO L93 Difference]: Finished difference Result 41465 states and 62854 transitions. [2019-11-07 01:06:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:55,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-07 01:06:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:55,491 INFO L225 Difference]: With dead ends: 41465 [2019-11-07 01:06:55,492 INFO L226 Difference]: Without dead ends: 22407 [2019-11-07 01:06:55,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:06:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22407 states. [2019-11-07 01:06:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22407 to 22407. [2019-11-07 01:06:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22407 states. [2019-11-07 01:06:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22407 states to 22407 states and 33453 transitions. [2019-11-07 01:06:56,697 INFO L78 Accepts]: Start accepts. Automaton has 22407 states and 33453 transitions. Word has length 121 [2019-11-07 01:06:56,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:56,697 INFO L462 AbstractCegarLoop]: Abstraction has 22407 states and 33453 transitions. [2019-11-07 01:06:56,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 22407 states and 33453 transitions. [2019-11-07 01:06:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-07 01:06:56,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:56,702 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] [2019-11-07 01:06:56,703 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1756764407, now seen corresponding path program 1 times [2019-11-07 01:06:56,703 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:56,703 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445589264] [2019-11-07 01:06:56,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:56,841 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:06:56,841 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445589264] [2019-11-07 01:06:56,841 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:56,841 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:56,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336891689] [2019-11-07 01:06:56,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:56,845 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:56,845 INFO L87 Difference]: Start difference. First operand 22407 states and 33453 transitions. Second operand 4 states. [2019-11-07 01:06:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:58,301 INFO L93 Difference]: Finished difference Result 45112 states and 67254 transitions. [2019-11-07 01:06:58,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:58,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-07 01:06:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:58,326 INFO L225 Difference]: With dead ends: 45112 [2019-11-07 01:06:58,326 INFO L226 Difference]: Without dead ends: 23050 [2019-11-07 01:06:58,343 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:06:58,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23050 states.