./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 084d7ddce3c53222c6533ccae99969e854061e3b422eaf94457157515e3bd009 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:29:52,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:29:52,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:29:52,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:29:52,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:29:52,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:29:52,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:29:52,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:29:52,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:29:52,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:29:52,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:29:52,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:29:52,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:29:52,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:29:52,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:29:52,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:29:52,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:29:52,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:29:52,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:29:52,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:29:52,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:29:52,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:29:52,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:29:52,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:29:52,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:29:52,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:29:52,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:29:52,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:29:52,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:29:52,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:29:52,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:29:52,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:29:52,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:29:52,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:29:52,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:29:52,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:29:52,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:29:52,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:29:52,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:29:52,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:29:52,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:29:52,659 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 05:29:52,702 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:29:52,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:29:52,704 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:29:52,704 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:29:52,704 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:29:52,704 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:29:52,705 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:29:52,705 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:29:52,705 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:29:52,705 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:29:52,706 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:29:52,707 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:29:52,707 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:29:52,707 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:29:52,707 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:29:52,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:29:52,708 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:29:52,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:29:52,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:29:52,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:29:52,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 05:29:52,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:29:52,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 05:29:52,710 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:29:52,710 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:29:52,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 05:29:52,710 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:29:52,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 05:29:52,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:29:52,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:29:52,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:29:52,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:29:52,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:29:52,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 05:29:52,714 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:29:52,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:29:52,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 05:29:52,714 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:29:52,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:29:52,715 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 084d7ddce3c53222c6533ccae99969e854061e3b422eaf94457157515e3bd009 [2021-11-03 05:29:52,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:29:52,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:29:53,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:29:53,002 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:29:53,003 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:29:53,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2021-11-03 05:29:53,066 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/data/18c1ae948/8cb7684fbbea498a9c16f9b6e83447b6/FLAG296519287 [2021-11-03 05:29:53,533 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:29:53,535 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2021-11-03 05:29:53,551 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/data/18c1ae948/8cb7684fbbea498a9c16f9b6e83447b6/FLAG296519287 [2021-11-03 05:29:53,886 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/data/18c1ae948/8cb7684fbbea498a9c16f9b6e83447b6 [2021-11-03 05:29:53,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:29:53,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:29:53,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:29:53,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:29:53,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:29:53,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:29:53" (1/1) ... [2021-11-03 05:29:53,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658dce44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:53, skipping insertion in model container [2021-11-03 05:29:53,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:29:53" (1/1) ... [2021-11-03 05:29:53,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:29:53,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:29:54,142 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c[3963,3976] [2021-11-03 05:29:54,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:29:54,154 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:29:54,186 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c[3963,3976] [2021-11-03 05:29:54,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:29:54,202 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:29:54,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54 WrapperNode [2021-11-03 05:29:54,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:29:54,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:29:54,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:29:54,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:29:54,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (1/1) ... [2021-11-03 05:29:54,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (1/1) ... [2021-11-03 05:29:54,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:29:54,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:29:54,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:29:54,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:29:54,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (1/1) ... [2021-11-03 05:29:54,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (1/1) ... [2021-11-03 05:29:54,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (1/1) ... [2021-11-03 05:29:54,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (1/1) ... [2021-11-03 05:29:54,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (1/1) ... [2021-11-03 05:29:54,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (1/1) ... [2021-11-03 05:29:54,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (1/1) ... [2021-11-03 05:29:54,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:29:54,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:29:54,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:29:54,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:29:54,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (1/1) ... [2021-11-03 05:29:54,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:29:54,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:29:54,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:29:54,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:29:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-03 05:29:54,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-03 05:29:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-03 05:29:54,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-03 05:29:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-03 05:29:54,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-03 05:29:54,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-11-03 05:29:54,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-11-03 05:29:54,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:29:54,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-11-03 05:29:54,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-11-03 05:29:54,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:29:54,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 05:29:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-03 05:29:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-03 05:29:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:29:54,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:29:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 05:29:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:29:54,403 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-03 05:29:54,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:29:54,997 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-11-03 05:29:54,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:29:54 BoogieIcfgContainer [2021-11-03 05:29:54,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:29:55,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:29:55,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:29:55,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:29:55,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:29:53" (1/3) ... [2021-11-03 05:29:55,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12adf665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:29:55, skipping insertion in model container [2021-11-03 05:29:55,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:29:54" (2/3) ... [2021-11-03 05:29:55,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12adf665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:29:55, skipping insertion in model container [2021-11-03 05:29:55,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:29:54" (3/3) ... [2021-11-03 05:29:55,008 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2021-11-03 05:29:55,013 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-03 05:29:55,014 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:29:55,014 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 05:29:55,014 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-03 05:29:55,101 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,102 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,102 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,102 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,103 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,103 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,103 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,104 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,104 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,104 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,104 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,104 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,105 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,105 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,105 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,106 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,106 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,106 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,106 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,107 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,107 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,107 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,107 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,108 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,108 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,108 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,108 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,109 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,109 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,109 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,110 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,110 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,110 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,110 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,111 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,111 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,111 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,111 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,112 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,112 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,112 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,112 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,113 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,113 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,113 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,114 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,114 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,114 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,115 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,115 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,115 WARN L313 ript$VariableManager]: TermVariabe thread5Thread1of1ForFork4_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,115 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,116 WARN L313 ript$VariableManager]: TermVariabe thread5Thread1of1ForFork4_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,116 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,116 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,117 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,117 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,117 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,117 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,117 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,120 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,121 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,121 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,121 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,122 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,122 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,124 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,124 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,124 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,125 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,125 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,125 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,127 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,127 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,127 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,128 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,128 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,128 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,130 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,130 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,130 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,131 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,131 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,131 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,133 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,133 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,133 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,134 WARN L313 ript$VariableManager]: TermVariabe thread5Thread1of1ForFork4_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,134 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,134 WARN L313 ript$VariableManager]: TermVariabe |thread5Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:29:55,147 INFO L148 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2021-11-03 05:29:55,190 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:29:55,197 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:29:55,198 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-03 05:29:55,225 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-03 05:29:55,236 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 157 transitions, 354 flow [2021-11-03 05:29:55,239 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 157 transitions, 354 flow [2021-11-03 05:29:55,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 157 transitions, 354 flow [2021-11-03 05:29:55,323 INFO L129 PetriNetUnfolder]: 2/152 cut-off events. [2021-11-03 05:29:55,323 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-11-03 05:29:55,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 152 events. 2/152 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2021-11-03 05:29:55,336 INFO L116 LiptonReduction]: Number of co-enabled transitions 2082 [2021-11-03 05:30:04,334 INFO L131 LiptonReduction]: Checked pairs total: 5154 [2021-11-03 05:30:04,334 INFO L133 LiptonReduction]: Total number of compositions: 125 [2021-11-03 05:30:04,351 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 38 transitions, 116 flow [2021-11-03 05:30:04,447 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1212 states, 1211 states have (on average 3.6779521056977704) internal successors, (4454), 1211 states have internal predecessors, (4454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 1212 states, 1211 states have (on average 3.6779521056977704) internal successors, (4454), 1211 states have internal predecessors, (4454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:04,476 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:04,477 INFO L513 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] [2021-11-03 05:30:04,478 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1621586228, now seen corresponding path program 1 times [2021-11-03 05:30:04,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:04,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862811220] [2021-11-03 05:30:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:04,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:05,002 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:05,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862811220] [2021-11-03 05:30:05,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862811220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:05,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:05,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:30:05,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216027965] [2021-11-03 05:30:05,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:30:05,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:05,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:30:05,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:05,035 INFO L87 Difference]: Start difference. First operand has 1212 states, 1211 states have (on average 3.6779521056977704) internal successors, (4454), 1211 states have internal predecessors, (4454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:05,357 INFO L93 Difference]: Finished difference Result 3082 states and 10817 transitions. [2021-11-03 05:30:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:05,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:05,404 INFO L225 Difference]: With dead ends: 3082 [2021-11-03 05:30:05,405 INFO L226 Difference]: Without dead ends: 3082 [2021-11-03 05:30:05,406 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2021-11-03 05:30:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 1818. [2021-11-03 05:30:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1817 states have (on average 3.6301596037424324) internal successors, (6596), 1817 states have internal predecessors, (6596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 6596 transitions. [2021-11-03 05:30:05,620 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 6596 transitions. Word has length 32 [2021-11-03 05:30:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:05,621 INFO L470 AbstractCegarLoop]: Abstraction has 1818 states and 6596 transitions. [2021-11-03 05:30:05,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 6596 transitions. [2021-11-03 05:30:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:05,630 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:05,630 INFO L513 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] [2021-11-03 05:30:05,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:30:05,631 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:05,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:05,632 INFO L85 PathProgramCache]: Analyzing trace with hash 140571216, now seen corresponding path program 2 times [2021-11-03 05:30:05,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:05,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426857110] [2021-11-03 05:30:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:05,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:05,825 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:05,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426857110] [2021-11-03 05:30:05,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426857110] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:05,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:05,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:30:05,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786678932] [2021-11-03 05:30:05,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:30:05,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:05,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:30:05,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:05,828 INFO L87 Difference]: Start difference. First operand 1818 states and 6596 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:06,097 INFO L93 Difference]: Finished difference Result 3282 states and 11448 transitions. [2021-11-03 05:30:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:06,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:06,135 INFO L225 Difference]: With dead ends: 3282 [2021-11-03 05:30:06,135 INFO L226 Difference]: Without dead ends: 3282 [2021-11-03 05:30:06,136 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2021-11-03 05:30:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 2228. [2021-11-03 05:30:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2227 states have (on average 3.6093399191737765) internal successors, (8038), 2227 states have internal predecessors, (8038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 8038 transitions. [2021-11-03 05:30:06,311 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 8038 transitions. Word has length 32 [2021-11-03 05:30:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:06,312 INFO L470 AbstractCegarLoop]: Abstraction has 2228 states and 8038 transitions. [2021-11-03 05:30:06,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 8038 transitions. [2021-11-03 05:30:06,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:06,323 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:06,324 INFO L513 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] [2021-11-03 05:30:06,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:30:06,325 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1014490562, now seen corresponding path program 3 times [2021-11-03 05:30:06,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:06,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190294637] [2021-11-03 05:30:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:06,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:06,713 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:06,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190294637] [2021-11-03 05:30:06,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190294637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:06,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:06,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:30:06,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29301400] [2021-11-03 05:30:06,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:30:06,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:06,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:30:06,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:30:06,719 INFO L87 Difference]: Start difference. First operand 2228 states and 8038 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:06,831 INFO L93 Difference]: Finished difference Result 3073 states and 10804 transitions. [2021-11-03 05:30:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:30:06,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:06,854 INFO L225 Difference]: With dead ends: 3073 [2021-11-03 05:30:06,854 INFO L226 Difference]: Without dead ends: 2194 [2021-11-03 05:30:06,855 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2021-11-03 05:30:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2194. [2021-11-03 05:30:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2194 states, 2193 states have (on average 3.4003647970816235) internal successors, (7457), 2193 states have internal predecessors, (7457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 7457 transitions. [2021-11-03 05:30:06,970 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 7457 transitions. Word has length 32 [2021-11-03 05:30:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:06,971 INFO L470 AbstractCegarLoop]: Abstraction has 2194 states and 7457 transitions. [2021-11-03 05:30:06,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 7457 transitions. [2021-11-03 05:30:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:06,983 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:06,983 INFO L513 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] [2021-11-03 05:30:06,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 05:30:06,983 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1203111510, now seen corresponding path program 4 times [2021-11-03 05:30:06,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:06,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189077071] [2021-11-03 05:30:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:06,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:07,158 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:07,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189077071] [2021-11-03 05:30:07,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189077071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:07,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:07,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:30:07,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388804183] [2021-11-03 05:30:07,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:30:07,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:30:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:30:07,162 INFO L87 Difference]: Start difference. First operand 2194 states and 7457 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:07,312 INFO L93 Difference]: Finished difference Result 2366 states and 8003 transitions. [2021-11-03 05:30:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:30:07,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:07,335 INFO L225 Difference]: With dead ends: 2366 [2021-11-03 05:30:07,336 INFO L226 Difference]: Without dead ends: 2366 [2021-11-03 05:30:07,336 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2021-11-03 05:30:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2278. [2021-11-03 05:30:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 3.3741765480895918) internal successors, (7683), 2277 states have internal predecessors, (7683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 7683 transitions. [2021-11-03 05:30:07,468 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 7683 transitions. Word has length 32 [2021-11-03 05:30:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:07,469 INFO L470 AbstractCegarLoop]: Abstraction has 2278 states and 7683 transitions. [2021-11-03 05:30:07,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 7683 transitions. [2021-11-03 05:30:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:07,480 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:07,480 INFO L513 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] [2021-11-03 05:30:07,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 05:30:07,482 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:07,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash -606117558, now seen corresponding path program 5 times [2021-11-03 05:30:07,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:07,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804448485] [2021-11-03 05:30:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:07,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:07,716 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:07,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804448485] [2021-11-03 05:30:07,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804448485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:07,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:07,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:07,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853066248] [2021-11-03 05:30:07,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:07,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:07,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:07,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:07,720 INFO L87 Difference]: Start difference. First operand 2278 states and 7683 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:08,035 INFO L93 Difference]: Finished difference Result 2394 states and 8063 transitions. [2021-11-03 05:30:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:08,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:08,060 INFO L225 Difference]: With dead ends: 2394 [2021-11-03 05:30:08,060 INFO L226 Difference]: Without dead ends: 2386 [2021-11-03 05:30:08,061 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2021-11-03 05:30:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2294. [2021-11-03 05:30:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 3.36284343654601) internal successors, (7711), 2293 states have internal predecessors, (7711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 7711 transitions. [2021-11-03 05:30:08,221 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 7711 transitions. Word has length 32 [2021-11-03 05:30:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:08,223 INFO L470 AbstractCegarLoop]: Abstraction has 2294 states and 7711 transitions. [2021-11-03 05:30:08,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 7711 transitions. [2021-11-03 05:30:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:08,231 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:08,231 INFO L513 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] [2021-11-03 05:30:08,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 05:30:08,232 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:08,232 INFO L85 PathProgramCache]: Analyzing trace with hash 741425566, now seen corresponding path program 6 times [2021-11-03 05:30:08,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:08,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542002934] [2021-11-03 05:30:08,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:08,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:08,373 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:08,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542002934] [2021-11-03 05:30:08,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542002934] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:08,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:08,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:30:08,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868347249] [2021-11-03 05:30:08,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:30:08,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:30:08,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:08,377 INFO L87 Difference]: Start difference. First operand 2294 states and 7711 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:08,642 INFO L93 Difference]: Finished difference Result 3934 states and 12920 transitions. [2021-11-03 05:30:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:08,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:08,684 INFO L225 Difference]: With dead ends: 3934 [2021-11-03 05:30:08,691 INFO L226 Difference]: Without dead ends: 3898 [2021-11-03 05:30:08,692 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2021-11-03 05:30:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 2470. [2021-11-03 05:30:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2469 states have (on average 3.3564196030781694) internal successors, (8287), 2469 states have internal predecessors, (8287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 8287 transitions. [2021-11-03 05:30:08,890 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 8287 transitions. Word has length 32 [2021-11-03 05:30:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:08,891 INFO L470 AbstractCegarLoop]: Abstraction has 2470 states and 8287 transitions. [2021-11-03 05:30:08,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 8287 transitions. [2021-11-03 05:30:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:08,901 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:08,902 INFO L513 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] [2021-11-03 05:30:08,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 05:30:08,902 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:08,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1167132422, now seen corresponding path program 7 times [2021-11-03 05:30:08,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:08,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425071266] [2021-11-03 05:30:08,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:08,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:09,008 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:09,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425071266] [2021-11-03 05:30:09,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425071266] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:09,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:09,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:09,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434644970] [2021-11-03 05:30:09,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:09,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:09,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:09,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:09,011 INFO L87 Difference]: Start difference. First operand 2470 states and 8287 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:09,215 INFO L93 Difference]: Finished difference Result 4000 states and 13030 transitions. [2021-11-03 05:30:09,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:30:09,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:09,232 INFO L225 Difference]: With dead ends: 4000 [2021-11-03 05:30:09,233 INFO L226 Difference]: Without dead ends: 3936 [2021-11-03 05:30:09,233 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2021-11-03 05:30:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 2652. [2021-11-03 05:30:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2651 states have (on average 3.3410033949453037) internal successors, (8857), 2651 states have internal predecessors, (8857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 8857 transitions. [2021-11-03 05:30:09,388 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 8857 transitions. Word has length 32 [2021-11-03 05:30:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:09,388 INFO L470 AbstractCegarLoop]: Abstraction has 2652 states and 8857 transitions. [2021-11-03 05:30:09,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 8857 transitions. [2021-11-03 05:30:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:09,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:09,400 INFO L513 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] [2021-11-03 05:30:09,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 05:30:09,401 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash -671214224, now seen corresponding path program 8 times [2021-11-03 05:30:09,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:09,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159918048] [2021-11-03 05:30:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:09,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:09,532 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:09,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159918048] [2021-11-03 05:30:09,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159918048] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:09,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:09,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:30:09,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286912798] [2021-11-03 05:30:09,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:30:09,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:30:09,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:30:09,537 INFO L87 Difference]: Start difference. First operand 2652 states and 8857 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:09,666 INFO L93 Difference]: Finished difference Result 2764 states and 9157 transitions. [2021-11-03 05:30:09,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:30:09,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:09,678 INFO L225 Difference]: With dead ends: 2764 [2021-11-03 05:30:09,678 INFO L226 Difference]: Without dead ends: 2732 [2021-11-03 05:30:09,678 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2021-11-03 05:30:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2614. [2021-11-03 05:30:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2613 states have (on average 3.3272101033295063) internal successors, (8694), 2613 states have internal predecessors, (8694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 8694 transitions. [2021-11-03 05:30:09,808 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 8694 transitions. Word has length 32 [2021-11-03 05:30:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:09,808 INFO L470 AbstractCegarLoop]: Abstraction has 2614 states and 8694 transitions. [2021-11-03 05:30:09,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 8694 transitions. [2021-11-03 05:30:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:09,820 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:09,821 INFO L513 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] [2021-11-03 05:30:09,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 05:30:09,822 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:09,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash 48562788, now seen corresponding path program 9 times [2021-11-03 05:30:09,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:09,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987913523] [2021-11-03 05:30:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:09,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:09,918 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:09,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987913523] [2021-11-03 05:30:09,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987913523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:09,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:09,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:30:09,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617351194] [2021-11-03 05:30:09,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:30:09,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:09,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:30:09,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:30:09,922 INFO L87 Difference]: Start difference. First operand 2614 states and 8694 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:10,049 INFO L93 Difference]: Finished difference Result 2670 states and 8728 transitions. [2021-11-03 05:30:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:30:10,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:10,062 INFO L225 Difference]: With dead ends: 2670 [2021-11-03 05:30:10,063 INFO L226 Difference]: Without dead ends: 2594 [2021-11-03 05:30:10,063 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2021-11-03 05:30:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2504. [2021-11-03 05:30:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2503 states have (on average 3.304434678385937) internal successors, (8271), 2503 states have internal predecessors, (8271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 8271 transitions. [2021-11-03 05:30:10,161 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 8271 transitions. Word has length 32 [2021-11-03 05:30:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:10,161 INFO L470 AbstractCegarLoop]: Abstraction has 2504 states and 8271 transitions. [2021-11-03 05:30:10,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 8271 transitions. [2021-11-03 05:30:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:10,169 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:10,170 INFO L513 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] [2021-11-03 05:30:10,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 05:30:10,170 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:10,171 INFO L85 PathProgramCache]: Analyzing trace with hash -301344148, now seen corresponding path program 10 times [2021-11-03 05:30:10,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:10,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415114662] [2021-11-03 05:30:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:10,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:10,364 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:10,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415114662] [2021-11-03 05:30:10,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415114662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:10,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:10,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:30:10,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907866471] [2021-11-03 05:30:10,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:30:10,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:30:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:30:10,366 INFO L87 Difference]: Start difference. First operand 2504 states and 8271 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:10,447 INFO L93 Difference]: Finished difference Result 2316 states and 7576 transitions. [2021-11-03 05:30:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:30:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:10,458 INFO L225 Difference]: With dead ends: 2316 [2021-11-03 05:30:10,458 INFO L226 Difference]: Without dead ends: 2316 [2021-11-03 05:30:10,459 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:30:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2021-11-03 05:30:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2316. [2021-11-03 05:30:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2315 states have (on average 3.2725701943844494) internal successors, (7576), 2315 states have internal predecessors, (7576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 7576 transitions. [2021-11-03 05:30:10,531 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 7576 transitions. Word has length 32 [2021-11-03 05:30:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:10,531 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 7576 transitions. [2021-11-03 05:30:10,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 7576 transitions. [2021-11-03 05:30:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:10,539 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:10,539 INFO L513 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] [2021-11-03 05:30:10,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 05:30:10,539 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1765782108, now seen corresponding path program 11 times [2021-11-03 05:30:10,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:10,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142187439] [2021-11-03 05:30:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:10,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:10,677 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:10,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142187439] [2021-11-03 05:30:10,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142187439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:10,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:10,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:10,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692473706] [2021-11-03 05:30:10,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:10,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:10,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:10,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:10,679 INFO L87 Difference]: Start difference. First operand 2316 states and 7576 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:10,788 INFO L93 Difference]: Finished difference Result 2388 states and 7776 transitions. [2021-11-03 05:30:10,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:30:10,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:10,798 INFO L225 Difference]: With dead ends: 2388 [2021-11-03 05:30:10,799 INFO L226 Difference]: Without dead ends: 2388 [2021-11-03 05:30:10,799 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2021-11-03 05:30:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2358. [2021-11-03 05:30:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 2357 states have (on average 3.264743317776835) internal successors, (7695), 2357 states have internal predecessors, (7695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 7695 transitions. [2021-11-03 05:30:10,888 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 7695 transitions. Word has length 32 [2021-11-03 05:30:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:10,889 INFO L470 AbstractCegarLoop]: Abstraction has 2358 states and 7695 transitions. [2021-11-03 05:30:10,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 7695 transitions. [2021-11-03 05:30:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:10,896 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:10,896 INFO L513 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] [2021-11-03 05:30:10,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 05:30:10,897 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:10,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1852980538, now seen corresponding path program 12 times [2021-11-03 05:30:10,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:10,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656676251] [2021-11-03 05:30:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:10,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:11,049 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:11,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656676251] [2021-11-03 05:30:11,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656676251] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:11,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:11,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:30:11,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820476977] [2021-11-03 05:30:11,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:30:11,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:11,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:30:11,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:11,052 INFO L87 Difference]: Start difference. First operand 2358 states and 7695 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:11,194 INFO L93 Difference]: Finished difference Result 2408 states and 7822 transitions. [2021-11-03 05:30:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:30:11,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:11,205 INFO L225 Difference]: With dead ends: 2408 [2021-11-03 05:30:11,205 INFO L226 Difference]: Without dead ends: 2408 [2021-11-03 05:30:11,205 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2021-11-03 05:30:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2376. [2021-11-03 05:30:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2375 states have (on average 3.2581052631578946) internal successors, (7738), 2375 states have internal predecessors, (7738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 7738 transitions. [2021-11-03 05:30:11,280 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 7738 transitions. Word has length 32 [2021-11-03 05:30:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:11,280 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 7738 transitions. [2021-11-03 05:30:11,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 7738 transitions. [2021-11-03 05:30:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:11,288 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:11,288 INFO L513 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] [2021-11-03 05:30:11,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 05:30:11,289 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:11,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:11,289 INFO L85 PathProgramCache]: Analyzing trace with hash 220518238, now seen corresponding path program 13 times [2021-11-03 05:30:11,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:11,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872021781] [2021-11-03 05:30:11,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:11,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:11,519 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:11,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872021781] [2021-11-03 05:30:11,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872021781] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:11,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:11,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:11,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759035155] [2021-11-03 05:30:11,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:11,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:11,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:11,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:11,521 INFO L87 Difference]: Start difference. First operand 2376 states and 7738 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:11,690 INFO L93 Difference]: Finished difference Result 2450 states and 7931 transitions. [2021-11-03 05:30:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:11,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:11,700 INFO L225 Difference]: With dead ends: 2450 [2021-11-03 05:30:11,700 INFO L226 Difference]: Without dead ends: 2442 [2021-11-03 05:30:11,700 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:11,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2021-11-03 05:30:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2376. [2021-11-03 05:30:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2375 states have (on average 3.257263157894737) internal successors, (7736), 2375 states have internal predecessors, (7736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 7736 transitions. [2021-11-03 05:30:11,768 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 7736 transitions. Word has length 32 [2021-11-03 05:30:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:11,769 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 7736 transitions. [2021-11-03 05:30:11,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 7736 transitions. [2021-11-03 05:30:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:11,776 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:11,776 INFO L513 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] [2021-11-03 05:30:11,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 05:30:11,777 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:11,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1199124574, now seen corresponding path program 14 times [2021-11-03 05:30:11,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:11,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147081180] [2021-11-03 05:30:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:11,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:11,917 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:11,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147081180] [2021-11-03 05:30:11,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147081180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:11,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:11,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:11,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490240234] [2021-11-03 05:30:11,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:11,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:11,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:11,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:11,919 INFO L87 Difference]: Start difference. First operand 2376 states and 7736 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:12,111 INFO L93 Difference]: Finished difference Result 2418 states and 7817 transitions. [2021-11-03 05:30:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:12,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:12,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:12,124 INFO L225 Difference]: With dead ends: 2418 [2021-11-03 05:30:12,124 INFO L226 Difference]: Without dead ends: 2410 [2021-11-03 05:30:12,125 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2021-11-03 05:30:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2380. [2021-11-03 05:30:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 3.253467843631778) internal successors, (7740), 2379 states have internal predecessors, (7740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 7740 transitions. [2021-11-03 05:30:12,206 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 7740 transitions. Word has length 32 [2021-11-03 05:30:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:12,206 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 7740 transitions. [2021-11-03 05:30:12,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 7740 transitions. [2021-11-03 05:30:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:12,216 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:12,216 INFO L513 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] [2021-11-03 05:30:12,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 05:30:12,216 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1148764768, now seen corresponding path program 15 times [2021-11-03 05:30:12,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:12,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183357791] [2021-11-03 05:30:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:12,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:12,368 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:12,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183357791] [2021-11-03 05:30:12,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183357791] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:12,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:12,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:30:12,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982689957] [2021-11-03 05:30:12,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:30:12,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:12,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:30:12,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:12,375 INFO L87 Difference]: Start difference. First operand 2380 states and 7740 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:12,559 INFO L93 Difference]: Finished difference Result 2502 states and 8083 transitions. [2021-11-03 05:30:12,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:30:12,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:12,570 INFO L225 Difference]: With dead ends: 2502 [2021-11-03 05:30:12,570 INFO L226 Difference]: Without dead ends: 2494 [2021-11-03 05:30:12,572 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2494 states. [2021-11-03 05:30:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2494 to 2364. [2021-11-03 05:30:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2363 states have (on average 3.2517985611510793) internal successors, (7684), 2363 states have internal predecessors, (7684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 7684 transitions. [2021-11-03 05:30:12,654 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 7684 transitions. Word has length 32 [2021-11-03 05:30:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:12,655 INFO L470 AbstractCegarLoop]: Abstraction has 2364 states and 7684 transitions. [2021-11-03 05:30:12,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 7684 transitions. [2021-11-03 05:30:12,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:12,664 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:12,664 INFO L513 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] [2021-11-03 05:30:12,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 05:30:12,665 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:12,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash -110719200, now seen corresponding path program 16 times [2021-11-03 05:30:12,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:12,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780439311] [2021-11-03 05:30:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:12,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:12,826 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:12,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780439311] [2021-11-03 05:30:12,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780439311] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:12,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:12,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:30:12,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445807488] [2021-11-03 05:30:12,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:30:12,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:12,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:30:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:12,831 INFO L87 Difference]: Start difference. First operand 2364 states and 7684 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:13,007 INFO L93 Difference]: Finished difference Result 2488 states and 8028 transitions. [2021-11-03 05:30:13,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:13,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:13,016 INFO L225 Difference]: With dead ends: 2488 [2021-11-03 05:30:13,017 INFO L226 Difference]: Without dead ends: 2468 [2021-11-03 05:30:13,017 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2021-11-03 05:30:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2358. [2021-11-03 05:30:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 2357 states have (on average 3.2528638099278746) internal successors, (7667), 2357 states have internal predecessors, (7667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 7667 transitions. [2021-11-03 05:30:13,084 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 7667 transitions. Word has length 32 [2021-11-03 05:30:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:13,085 INFO L470 AbstractCegarLoop]: Abstraction has 2358 states and 7667 transitions. [2021-11-03 05:30:13,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 7667 transitions. [2021-11-03 05:30:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:13,092 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:13,092 INFO L513 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] [2021-11-03 05:30:13,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 05:30:13,093 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:13,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1408883450, now seen corresponding path program 17 times [2021-11-03 05:30:13,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:13,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221880857] [2021-11-03 05:30:13,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:13,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:13,208 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:13,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221880857] [2021-11-03 05:30:13,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221880857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:13,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:13,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:30:13,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663612250] [2021-11-03 05:30:13,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:30:13,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:13,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:30:13,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:13,211 INFO L87 Difference]: Start difference. First operand 2358 states and 7667 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:13,379 INFO L93 Difference]: Finished difference Result 2448 states and 7874 transitions. [2021-11-03 05:30:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:30:13,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:13,387 INFO L225 Difference]: With dead ends: 2448 [2021-11-03 05:30:13,388 INFO L226 Difference]: Without dead ends: 2426 [2021-11-03 05:30:13,388 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2021-11-03 05:30:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2364. [2021-11-03 05:30:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2363 states have (on average 3.2517985611510793) internal successors, (7684), 2363 states have internal predecessors, (7684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 7684 transitions. [2021-11-03 05:30:13,452 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 7684 transitions. Word has length 32 [2021-11-03 05:30:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:13,453 INFO L470 AbstractCegarLoop]: Abstraction has 2364 states and 7684 transitions. [2021-11-03 05:30:13,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 7684 transitions. [2021-11-03 05:30:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:13,460 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:13,461 INFO L513 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] [2021-11-03 05:30:13,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 05:30:13,461 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:13,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash 684652868, now seen corresponding path program 18 times [2021-11-03 05:30:13,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:13,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369192697] [2021-11-03 05:30:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:13,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:13,592 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:13,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369192697] [2021-11-03 05:30:13,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369192697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:13,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:13,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:13,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035621634] [2021-11-03 05:30:13,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:13,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:13,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:13,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:13,594 INFO L87 Difference]: Start difference. First operand 2364 states and 7684 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:13,704 INFO L93 Difference]: Finished difference Result 2452 states and 7902 transitions. [2021-11-03 05:30:13,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:30:13,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:13,712 INFO L225 Difference]: With dead ends: 2452 [2021-11-03 05:30:13,712 INFO L226 Difference]: Without dead ends: 2436 [2021-11-03 05:30:13,713 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2021-11-03 05:30:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2378. [2021-11-03 05:30:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2377 states have (on average 3.24652923853597) internal successors, (7717), 2377 states have internal predecessors, (7717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 7717 transitions. [2021-11-03 05:30:13,777 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 7717 transitions. Word has length 32 [2021-11-03 05:30:13,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:13,778 INFO L470 AbstractCegarLoop]: Abstraction has 2378 states and 7717 transitions. [2021-11-03 05:30:13,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 7717 transitions. [2021-11-03 05:30:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:13,785 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:13,785 INFO L513 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] [2021-11-03 05:30:13,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-03 05:30:13,785 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1784339528, now seen corresponding path program 19 times [2021-11-03 05:30:13,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:13,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467192101] [2021-11-03 05:30:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:13,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:13,895 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:13,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467192101] [2021-11-03 05:30:13,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467192101] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:13,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:13,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:30:13,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690313687] [2021-11-03 05:30:13,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:30:13,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:30:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:13,898 INFO L87 Difference]: Start difference. First operand 2378 states and 7717 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:14,043 INFO L93 Difference]: Finished difference Result 2496 states and 8036 transitions. [2021-11-03 05:30:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:30:14,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:14,053 INFO L225 Difference]: With dead ends: 2496 [2021-11-03 05:30:14,053 INFO L226 Difference]: Without dead ends: 2476 [2021-11-03 05:30:14,053 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2021-11-03 05:30:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2354. [2021-11-03 05:30:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 2353 states have (on average 3.251593710157246) internal successors, (7651), 2353 states have internal predecessors, (7651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 7651 transitions. [2021-11-03 05:30:14,117 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 7651 transitions. Word has length 32 [2021-11-03 05:30:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:14,117 INFO L470 AbstractCegarLoop]: Abstraction has 2354 states and 7651 transitions. [2021-11-03 05:30:14,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 7651 transitions. [2021-11-03 05:30:14,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:14,125 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:14,125 INFO L513 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] [2021-11-03 05:30:14,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-03 05:30:14,126 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:14,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1818697986, now seen corresponding path program 20 times [2021-11-03 05:30:14,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:14,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009320640] [2021-11-03 05:30:14,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:14,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:14,229 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:14,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009320640] [2021-11-03 05:30:14,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009320640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:14,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:14,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:14,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641461599] [2021-11-03 05:30:14,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:14,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:14,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:14,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:14,231 INFO L87 Difference]: Start difference. First operand 2354 states and 7651 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:14,385 INFO L93 Difference]: Finished difference Result 2492 states and 8040 transitions. [2021-11-03 05:30:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:30:14,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:14,412 INFO L225 Difference]: With dead ends: 2492 [2021-11-03 05:30:14,413 INFO L226 Difference]: Without dead ends: 2468 [2021-11-03 05:30:14,413 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2021-11-03 05:30:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2356. [2021-11-03 05:30:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 3.248407643312102) internal successors, (7650), 2355 states have internal predecessors, (7650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 7650 transitions. [2021-11-03 05:30:14,473 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 7650 transitions. Word has length 32 [2021-11-03 05:30:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:14,474 INFO L470 AbstractCegarLoop]: Abstraction has 2356 states and 7650 transitions. [2021-11-03 05:30:14,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 7650 transitions. [2021-11-03 05:30:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:14,481 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:14,481 INFO L513 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] [2021-11-03 05:30:14,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-03 05:30:14,482 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:14,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:14,482 INFO L85 PathProgramCache]: Analyzing trace with hash 535310952, now seen corresponding path program 21 times [2021-11-03 05:30:14,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:14,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372494753] [2021-11-03 05:30:14,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:14,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:14,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:14,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372494753] [2021-11-03 05:30:14,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372494753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:14,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:14,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:14,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475107457] [2021-11-03 05:30:14,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:14,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:14,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:14,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:14,596 INFO L87 Difference]: Start difference. First operand 2356 states and 7650 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:14,755 INFO L93 Difference]: Finished difference Result 2468 states and 7966 transitions. [2021-11-03 05:30:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:30:14,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:14,764 INFO L225 Difference]: With dead ends: 2468 [2021-11-03 05:30:14,765 INFO L226 Difference]: Without dead ends: 2452 [2021-11-03 05:30:14,765 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2021-11-03 05:30:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2348. [2021-11-03 05:30:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2347 states have (on average 3.2449936088623774) internal successors, (7616), 2347 states have internal predecessors, (7616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 7616 transitions. [2021-11-03 05:30:14,828 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 7616 transitions. Word has length 32 [2021-11-03 05:30:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:14,829 INFO L470 AbstractCegarLoop]: Abstraction has 2348 states and 7616 transitions. [2021-11-03 05:30:14,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 7616 transitions. [2021-11-03 05:30:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:14,837 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:14,837 INFO L513 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] [2021-11-03 05:30:14,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-03 05:30:14,837 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:14,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -40134546, now seen corresponding path program 22 times [2021-11-03 05:30:14,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:14,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746081325] [2021-11-03 05:30:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:14,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:14,966 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:14,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746081325] [2021-11-03 05:30:14,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746081325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:14,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:14,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:14,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669544179] [2021-11-03 05:30:14,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:14,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:14,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:14,968 INFO L87 Difference]: Start difference. First operand 2348 states and 7616 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:15,123 INFO L93 Difference]: Finished difference Result 2480 states and 7978 transitions. [2021-11-03 05:30:15,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:30:15,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:15,130 INFO L225 Difference]: With dead ends: 2480 [2021-11-03 05:30:15,131 INFO L226 Difference]: Without dead ends: 2448 [2021-11-03 05:30:15,132 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2021-11-03 05:30:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2346. [2021-11-03 05:30:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 3.246908315565032) internal successors, (7614), 2345 states have internal predecessors, (7614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 7614 transitions. [2021-11-03 05:30:15,190 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 7614 transitions. Word has length 32 [2021-11-03 05:30:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:15,191 INFO L470 AbstractCegarLoop]: Abstraction has 2346 states and 7614 transitions. [2021-11-03 05:30:15,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 7614 transitions. [2021-11-03 05:30:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:15,198 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:15,198 INFO L513 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] [2021-11-03 05:30:15,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-03 05:30:15,199 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:15,199 INFO L85 PathProgramCache]: Analyzing trace with hash 310948800, now seen corresponding path program 23 times [2021-11-03 05:30:15,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:15,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590570211] [2021-11-03 05:30:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:15,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:15,322 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:15,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590570211] [2021-11-03 05:30:15,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590570211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:15,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:15,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:15,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441962033] [2021-11-03 05:30:15,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:15,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:15,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:15,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:15,325 INFO L87 Difference]: Start difference. First operand 2346 states and 7614 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:15,452 INFO L93 Difference]: Finished difference Result 2430 states and 7806 transitions. [2021-11-03 05:30:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:30:15,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:15,461 INFO L225 Difference]: With dead ends: 2430 [2021-11-03 05:30:15,461 INFO L226 Difference]: Without dead ends: 2390 [2021-11-03 05:30:15,462 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2021-11-03 05:30:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2328. [2021-11-03 05:30:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2327 states have (on average 3.2518263859045984) internal successors, (7567), 2327 states have internal predecessors, (7567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 7567 transitions. [2021-11-03 05:30:15,553 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 7567 transitions. Word has length 32 [2021-11-03 05:30:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:15,553 INFO L470 AbstractCegarLoop]: Abstraction has 2328 states and 7567 transitions. [2021-11-03 05:30:15,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 7567 transitions. [2021-11-03 05:30:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:15,561 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:15,561 INFO L513 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] [2021-11-03 05:30:15,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-03 05:30:15,561 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:15,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:15,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1581143432, now seen corresponding path program 24 times [2021-11-03 05:30:15,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:15,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128458392] [2021-11-03 05:30:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:15,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:15,676 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:15,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128458392] [2021-11-03 05:30:15,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128458392] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:15,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:15,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:15,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237633109] [2021-11-03 05:30:15,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:15,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:15,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:15,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:15,678 INFO L87 Difference]: Start difference. First operand 2328 states and 7567 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:15,956 INFO L93 Difference]: Finished difference Result 2648 states and 8464 transitions. [2021-11-03 05:30:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:15,964 INFO L225 Difference]: With dead ends: 2648 [2021-11-03 05:30:15,964 INFO L226 Difference]: Without dead ends: 2648 [2021-11-03 05:30:15,965 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2021-11-03 05:30:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2544. [2021-11-03 05:30:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2543 states have (on average 3.2170664569406213) internal successors, (8181), 2543 states have internal predecessors, (8181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8181 transitions. [2021-11-03 05:30:16,029 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8181 transitions. Word has length 32 [2021-11-03 05:30:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:16,029 INFO L470 AbstractCegarLoop]: Abstraction has 2544 states and 8181 transitions. [2021-11-03 05:30:16,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8181 transitions. [2021-11-03 05:30:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:16,037 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:16,037 INFO L513 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] [2021-11-03 05:30:16,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-03 05:30:16,038 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:16,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2099640304, now seen corresponding path program 25 times [2021-11-03 05:30:16,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:16,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870654327] [2021-11-03 05:30:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:16,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:16,175 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:16,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870654327] [2021-11-03 05:30:16,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870654327] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:16,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:16,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:16,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191067728] [2021-11-03 05:30:16,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:16,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:16,177 INFO L87 Difference]: Start difference. First operand 2544 states and 8181 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:16,409 INFO L93 Difference]: Finished difference Result 2800 states and 8849 transitions. [2021-11-03 05:30:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:16,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:16,418 INFO L225 Difference]: With dead ends: 2800 [2021-11-03 05:30:16,418 INFO L226 Difference]: Without dead ends: 2792 [2021-11-03 05:30:16,419 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2021-11-03 05:30:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2556. [2021-11-03 05:30:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2555 states have (on average 3.213698630136986) internal successors, (8211), 2555 states have internal predecessors, (8211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 8211 transitions. [2021-11-03 05:30:16,486 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 8211 transitions. Word has length 32 [2021-11-03 05:30:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:16,487 INFO L470 AbstractCegarLoop]: Abstraction has 2556 states and 8211 transitions. [2021-11-03 05:30:16,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 8211 transitions. [2021-11-03 05:30:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:16,494 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:16,494 INFO L513 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] [2021-11-03 05:30:16,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-03 05:30:16,495 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:16,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1542878000, now seen corresponding path program 26 times [2021-11-03 05:30:16,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:16,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973303376] [2021-11-03 05:30:16,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:16,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:16,619 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:16,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973303376] [2021-11-03 05:30:16,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973303376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:16,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:16,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:16,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204851989] [2021-11-03 05:30:16,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:16,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:16,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:16,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:16,622 INFO L87 Difference]: Start difference. First operand 2556 states and 8211 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:16,758 INFO L93 Difference]: Finished difference Result 2564 states and 8199 transitions. [2021-11-03 05:30:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:30:16,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:16,775 INFO L225 Difference]: With dead ends: 2564 [2021-11-03 05:30:16,776 INFO L226 Difference]: Without dead ends: 2564 [2021-11-03 05:30:16,776 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2021-11-03 05:30:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2564. [2021-11-03 05:30:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2563 states have (on average 3.198985563792431) internal successors, (8199), 2563 states have internal predecessors, (8199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 8199 transitions. [2021-11-03 05:30:16,862 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 8199 transitions. Word has length 32 [2021-11-03 05:30:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:16,863 INFO L470 AbstractCegarLoop]: Abstraction has 2564 states and 8199 transitions. [2021-11-03 05:30:16,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 8199 transitions. [2021-11-03 05:30:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:16,875 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:16,875 INFO L513 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] [2021-11-03 05:30:16,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-03 05:30:16,876 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:16,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash 107011098, now seen corresponding path program 27 times [2021-11-03 05:30:16,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:16,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611813833] [2021-11-03 05:30:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:16,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:17,019 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:17,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611813833] [2021-11-03 05:30:17,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611813833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:17,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:17,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:17,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27236280] [2021-11-03 05:30:17,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:17,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:17,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:17,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:17,021 INFO L87 Difference]: Start difference. First operand 2564 states and 8199 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:17,239 INFO L93 Difference]: Finished difference Result 2652 states and 8375 transitions. [2021-11-03 05:30:17,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:17,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:17,251 INFO L225 Difference]: With dead ends: 2652 [2021-11-03 05:30:17,251 INFO L226 Difference]: Without dead ends: 2644 [2021-11-03 05:30:17,252 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:30:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2021-11-03 05:30:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2570. [2021-11-03 05:30:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2569 states have (on average 3.1957960295834957) internal successors, (8210), 2569 states have internal predecessors, (8210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 8210 transitions. [2021-11-03 05:30:17,329 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 8210 transitions. Word has length 32 [2021-11-03 05:30:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:17,330 INFO L470 AbstractCegarLoop]: Abstraction has 2570 states and 8210 transitions. [2021-11-03 05:30:17,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 8210 transitions. [2021-11-03 05:30:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:17,337 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:17,337 INFO L513 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] [2021-11-03 05:30:17,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-03 05:30:17,337 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash -134690532, now seen corresponding path program 28 times [2021-11-03 05:30:17,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:17,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768346280] [2021-11-03 05:30:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:17,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:17,483 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:17,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768346280] [2021-11-03 05:30:17,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768346280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:17,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:17,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:17,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257896218] [2021-11-03 05:30:17,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:17,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:17,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:17,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:17,487 INFO L87 Difference]: Start difference. First operand 2570 states and 8210 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:17,703 INFO L93 Difference]: Finished difference Result 2630 states and 8322 transitions. [2021-11-03 05:30:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:17,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:17,714 INFO L225 Difference]: With dead ends: 2630 [2021-11-03 05:30:17,714 INFO L226 Difference]: Without dead ends: 2620 [2021-11-03 05:30:17,715 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2021-11-03 05:30:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2572. [2021-11-03 05:30:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2571 states have (on average 3.193698949824971) internal successors, (8211), 2571 states have internal predecessors, (8211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 8211 transitions. [2021-11-03 05:30:17,792 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 8211 transitions. Word has length 32 [2021-11-03 05:30:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:17,792 INFO L470 AbstractCegarLoop]: Abstraction has 2572 states and 8211 transitions. [2021-11-03 05:30:17,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 8211 transitions. [2021-11-03 05:30:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:17,798 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:17,799 INFO L513 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] [2021-11-03 05:30:17,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-03 05:30:17,799 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:17,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash -119754026, now seen corresponding path program 29 times [2021-11-03 05:30:17,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:17,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907771850] [2021-11-03 05:30:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:17,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:17,938 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:17,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907771850] [2021-11-03 05:30:17,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907771850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:17,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:17,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:17,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957413210] [2021-11-03 05:30:17,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:17,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:17,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:17,941 INFO L87 Difference]: Start difference. First operand 2572 states and 8211 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:18,147 INFO L93 Difference]: Finished difference Result 4018 states and 12463 transitions. [2021-11-03 05:30:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:18,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:18,157 INFO L225 Difference]: With dead ends: 4018 [2021-11-03 05:30:18,158 INFO L226 Difference]: Without dead ends: 3990 [2021-11-03 05:30:18,159 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2021-11-03 05:30:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 2864. [2021-11-03 05:30:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2863 states have (on average 3.154383513796717) internal successors, (9031), 2863 states have internal predecessors, (9031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 9031 transitions. [2021-11-03 05:30:18,247 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 9031 transitions. Word has length 32 [2021-11-03 05:30:18,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:18,247 INFO L470 AbstractCegarLoop]: Abstraction has 2864 states and 9031 transitions. [2021-11-03 05:30:18,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 9031 transitions. [2021-11-03 05:30:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:18,254 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:18,254 INFO L513 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] [2021-11-03 05:30:18,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-03 05:30:18,254 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash -733937586, now seen corresponding path program 30 times [2021-11-03 05:30:18,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:18,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085367980] [2021-11-03 05:30:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:18,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:18,416 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:18,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085367980] [2021-11-03 05:30:18,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085367980] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:18,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:18,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:18,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421347957] [2021-11-03 05:30:18,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:18,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:18,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:18,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:18,418 INFO L87 Difference]: Start difference. First operand 2864 states and 9031 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:18,630 INFO L93 Difference]: Finished difference Result 3922 states and 12184 transitions. [2021-11-03 05:30:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:18,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:18,640 INFO L225 Difference]: With dead ends: 3922 [2021-11-03 05:30:18,641 INFO L226 Difference]: Without dead ends: 3914 [2021-11-03 05:30:18,643 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2021-11-03 05:30:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 2860. [2021-11-03 05:30:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2859 states have (on average 3.155299055613851) internal successors, (9021), 2859 states have internal predecessors, (9021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 9021 transitions. [2021-11-03 05:30:18,752 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 9021 transitions. Word has length 32 [2021-11-03 05:30:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:18,752 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 9021 transitions. [2021-11-03 05:30:18,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 9021 transitions. [2021-11-03 05:30:18,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:18,758 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:18,759 INFO L513 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] [2021-11-03 05:30:18,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-03 05:30:18,759 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:18,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:18,760 INFO L85 PathProgramCache]: Analyzing trace with hash -363958906, now seen corresponding path program 31 times [2021-11-03 05:30:18,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:18,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299941513] [2021-11-03 05:30:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:18,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:18,884 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:18,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299941513] [2021-11-03 05:30:18,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299941513] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:18,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:18,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:18,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035467659] [2021-11-03 05:30:18,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:18,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:18,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:18,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:18,887 INFO L87 Difference]: Start difference. First operand 2860 states and 9021 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:19,098 INFO L93 Difference]: Finished difference Result 4014 states and 12332 transitions. [2021-11-03 05:30:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:19,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:19,108 INFO L225 Difference]: With dead ends: 4014 [2021-11-03 05:30:19,108 INFO L226 Difference]: Without dead ends: 3978 [2021-11-03 05:30:19,109 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2021-11-03 05:30:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 2996. [2021-11-03 05:30:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2995 states have (on average 3.121535893155259) internal successors, (9349), 2995 states have internal predecessors, (9349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 9349 transitions. [2021-11-03 05:30:19,198 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 9349 transitions. Word has length 32 [2021-11-03 05:30:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:19,199 INFO L470 AbstractCegarLoop]: Abstraction has 2996 states and 9349 transitions. [2021-11-03 05:30:19,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 9349 transitions. [2021-11-03 05:30:19,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:19,208 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:19,208 INFO L513 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] [2021-11-03 05:30:19,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-03 05:30:19,209 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1826398678, now seen corresponding path program 32 times [2021-11-03 05:30:19,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:19,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077388868] [2021-11-03 05:30:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:19,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:19,322 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:19,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077388868] [2021-11-03 05:30:19,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077388868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:19,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:19,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:19,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078938745] [2021-11-03 05:30:19,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:19,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:19,324 INFO L87 Difference]: Start difference. First operand 2996 states and 9349 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:19,552 INFO L93 Difference]: Finished difference Result 3104 states and 9613 transitions. [2021-11-03 05:30:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:19,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:19,561 INFO L225 Difference]: With dead ends: 3104 [2021-11-03 05:30:19,561 INFO L226 Difference]: Without dead ends: 3096 [2021-11-03 05:30:19,562 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2021-11-03 05:30:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3020. [2021-11-03 05:30:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 3019 states have (on average 3.119244783040742) internal successors, (9417), 3019 states have internal predecessors, (9417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 9417 transitions. [2021-11-03 05:30:19,638 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 9417 transitions. Word has length 32 [2021-11-03 05:30:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:19,638 INFO L470 AbstractCegarLoop]: Abstraction has 3020 states and 9417 transitions. [2021-11-03 05:30:19,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 9417 transitions. [2021-11-03 05:30:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:19,645 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:19,645 INFO L513 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] [2021-11-03 05:30:19,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-03 05:30:19,646 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:19,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash -780414088, now seen corresponding path program 33 times [2021-11-03 05:30:19,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:19,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813506952] [2021-11-03 05:30:19,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:19,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:19,803 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:19,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813506952] [2021-11-03 05:30:19,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813506952] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:19,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:19,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:19,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207331370] [2021-11-03 05:30:19,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:19,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:19,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:19,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:19,806 INFO L87 Difference]: Start difference. First operand 3020 states and 9417 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:20,053 INFO L93 Difference]: Finished difference Result 3326 states and 10168 transitions. [2021-11-03 05:30:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:20,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:20,059 INFO L225 Difference]: With dead ends: 3326 [2021-11-03 05:30:20,060 INFO L226 Difference]: Without dead ends: 3318 [2021-11-03 05:30:20,060 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:30:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3318 states. [2021-11-03 05:30:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3318 to 3036. [2021-11-03 05:30:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3035 states have (on average 3.1172981878088963) internal successors, (9461), 3035 states have internal predecessors, (9461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 9461 transitions. [2021-11-03 05:30:20,159 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 9461 transitions. Word has length 32 [2021-11-03 05:30:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:20,159 INFO L470 AbstractCegarLoop]: Abstraction has 3036 states and 9461 transitions. [2021-11-03 05:30:20,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 9461 transitions. [2021-11-03 05:30:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:20,170 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:20,170 INFO L513 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] [2021-11-03 05:30:20,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-03 05:30:20,170 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:20,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:20,171 INFO L85 PathProgramCache]: Analyzing trace with hash -285513214, now seen corresponding path program 34 times [2021-11-03 05:30:20,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:20,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703469123] [2021-11-03 05:30:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:20,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:20,386 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:20,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703469123] [2021-11-03 05:30:20,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703469123] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:20,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:20,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:20,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283378986] [2021-11-03 05:30:20,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:20,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:20,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:20,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:20,389 INFO L87 Difference]: Start difference. First operand 3036 states and 9461 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:20,625 INFO L93 Difference]: Finished difference Result 3132 states and 9664 transitions. [2021-11-03 05:30:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:20,626 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:20,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:20,633 INFO L225 Difference]: With dead ends: 3132 [2021-11-03 05:30:20,633 INFO L226 Difference]: Without dead ends: 3110 [2021-11-03 05:30:20,633 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2021-11-03 05:30:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3038. [2021-11-03 05:30:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 3037 states have (on average 3.116562397102404) internal successors, (9465), 3037 states have internal predecessors, (9465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 9465 transitions. [2021-11-03 05:30:20,699 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 9465 transitions. Word has length 32 [2021-11-03 05:30:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:20,699 INFO L470 AbstractCegarLoop]: Abstraction has 3038 states and 9465 transitions. [2021-11-03 05:30:20,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 9465 transitions. [2021-11-03 05:30:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:20,706 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:20,706 INFO L513 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] [2021-11-03 05:30:20,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-03 05:30:20,706 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:20,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash 75068344, now seen corresponding path program 35 times [2021-11-03 05:30:20,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:20,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119271008] [2021-11-03 05:30:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:20,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:20,823 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:20,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119271008] [2021-11-03 05:30:20,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119271008] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:20,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:20,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:20,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039233821] [2021-11-03 05:30:20,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:20,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:20,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:20,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:20,825 INFO L87 Difference]: Start difference. First operand 3038 states and 9465 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:21,043 INFO L93 Difference]: Finished difference Result 3126 states and 9645 transitions. [2021-11-03 05:30:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:21,043 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:21,051 INFO L225 Difference]: With dead ends: 3126 [2021-11-03 05:30:21,051 INFO L226 Difference]: Without dead ends: 3098 [2021-11-03 05:30:21,052 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2021-11-03 05:30:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3034. [2021-11-03 05:30:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3033 states have (on average 3.1183646554566438) internal successors, (9458), 3033 states have internal predecessors, (9458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 9458 transitions. [2021-11-03 05:30:21,126 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 9458 transitions. Word has length 32 [2021-11-03 05:30:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:21,126 INFO L470 AbstractCegarLoop]: Abstraction has 3034 states and 9458 transitions. [2021-11-03 05:30:21,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 9458 transitions. [2021-11-03 05:30:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:21,133 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:21,133 INFO L513 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] [2021-11-03 05:30:21,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-03 05:30:21,134 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash -242685130, now seen corresponding path program 36 times [2021-11-03 05:30:21,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:21,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005759285] [2021-11-03 05:30:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:21,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:21,246 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:21,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005759285] [2021-11-03 05:30:21,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005759285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:21,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:21,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:21,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280107792] [2021-11-03 05:30:21,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:21,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:21,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:21,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:21,248 INFO L87 Difference]: Start difference. First operand 3034 states and 9458 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:21,436 INFO L93 Difference]: Finished difference Result 3082 states and 9558 transitions. [2021-11-03 05:30:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:21,444 INFO L225 Difference]: With dead ends: 3082 [2021-11-03 05:30:21,444 INFO L226 Difference]: Without dead ends: 3082 [2021-11-03 05:30:21,445 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2021-11-03 05:30:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3082. [2021-11-03 05:30:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 3081 states have (on average 3.1022395326192793) internal successors, (9558), 3081 states have internal predecessors, (9558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 9558 transitions. [2021-11-03 05:30:21,516 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 9558 transitions. Word has length 32 [2021-11-03 05:30:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:21,517 INFO L470 AbstractCegarLoop]: Abstraction has 3082 states and 9558 transitions. [2021-11-03 05:30:21,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 9558 transitions. [2021-11-03 05:30:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:21,523 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:21,523 INFO L513 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] [2021-11-03 05:30:21,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-03 05:30:21,524 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1444995306, now seen corresponding path program 37 times [2021-11-03 05:30:21,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:21,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755576364] [2021-11-03 05:30:21,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:21,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:21,645 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:21,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755576364] [2021-11-03 05:30:21,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755576364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:21,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:21,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:21,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142702207] [2021-11-03 05:30:21,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:21,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:21,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:21,647 INFO L87 Difference]: Start difference. First operand 3082 states and 9558 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:21,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:21,980 INFO L93 Difference]: Finished difference Result 4086 states and 12376 transitions. [2021-11-03 05:30:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 05:30:21,980 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:21,990 INFO L225 Difference]: With dead ends: 4086 [2021-11-03 05:30:21,991 INFO L226 Difference]: Without dead ends: 4070 [2021-11-03 05:30:21,991 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:30:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4070 states. [2021-11-03 05:30:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4070 to 3038. [2021-11-03 05:30:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 3037 states have (on average 3.0842937108989132) internal successors, (9367), 3037 states have internal predecessors, (9367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 9367 transitions. [2021-11-03 05:30:22,085 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 9367 transitions. Word has length 32 [2021-11-03 05:30:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:22,086 INFO L470 AbstractCegarLoop]: Abstraction has 3038 states and 9367 transitions. [2021-11-03 05:30:22,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 9367 transitions. [2021-11-03 05:30:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:22,093 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:22,093 INFO L513 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] [2021-11-03 05:30:22,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-03 05:30:22,093 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:22,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash -416087804, now seen corresponding path program 38 times [2021-11-03 05:30:22,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:22,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132059068] [2021-11-03 05:30:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:22,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:22,261 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:22,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132059068] [2021-11-03 05:30:22,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132059068] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:22,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:22,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:22,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565373517] [2021-11-03 05:30:22,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:22,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:22,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:22,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:22,264 INFO L87 Difference]: Start difference. First operand 3038 states and 9367 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:22,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:22,603 INFO L93 Difference]: Finished difference Result 3318 states and 10030 transitions. [2021-11-03 05:30:22,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:22,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:22,612 INFO L225 Difference]: With dead ends: 3318 [2021-11-03 05:30:22,612 INFO L226 Difference]: Without dead ends: 3306 [2021-11-03 05:30:22,613 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:30:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2021-11-03 05:30:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3058. [2021-11-03 05:30:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 3057 states have (on average 3.0791625776905462) internal successors, (9413), 3057 states have internal predecessors, (9413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 9413 transitions. [2021-11-03 05:30:22,691 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 9413 transitions. Word has length 32 [2021-11-03 05:30:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:22,691 INFO L470 AbstractCegarLoop]: Abstraction has 3058 states and 9413 transitions. [2021-11-03 05:30:22,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 9413 transitions. [2021-11-03 05:30:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:22,698 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:22,699 INFO L513 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] [2021-11-03 05:30:22,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-03 05:30:22,699 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:22,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1093095976, now seen corresponding path program 39 times [2021-11-03 05:30:22,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:22,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242563432] [2021-11-03 05:30:22,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:22,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:22,831 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:22,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242563432] [2021-11-03 05:30:22,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242563432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:22,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:22,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:22,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367263727] [2021-11-03 05:30:22,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:22,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:22,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:22,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:22,833 INFO L87 Difference]: Start difference. First operand 3058 states and 9413 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:23,114 INFO L93 Difference]: Finished difference Result 3158 states and 9620 transitions. [2021-11-03 05:30:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 05:30:23,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:23,120 INFO L225 Difference]: With dead ends: 3158 [2021-11-03 05:30:23,120 INFO L226 Difference]: Without dead ends: 3142 [2021-11-03 05:30:23,120 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:30:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2021-11-03 05:30:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3058. [2021-11-03 05:30:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 3057 states have (on average 3.0785083415112857) internal successors, (9411), 3057 states have internal predecessors, (9411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 9411 transitions. [2021-11-03 05:30:23,195 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 9411 transitions. Word has length 32 [2021-11-03 05:30:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:23,195 INFO L470 AbstractCegarLoop]: Abstraction has 3058 states and 9411 transitions. [2021-11-03 05:30:23,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 9411 transitions. [2021-11-03 05:30:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:23,202 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:23,202 INFO L513 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] [2021-11-03 05:30:23,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-03 05:30:23,203 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1334797606, now seen corresponding path program 40 times [2021-11-03 05:30:23,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:23,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560113123] [2021-11-03 05:30:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:23,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:23,328 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:23,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560113123] [2021-11-03 05:30:23,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560113123] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:23,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:23,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:23,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833025282] [2021-11-03 05:30:23,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:23,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:23,331 INFO L87 Difference]: Start difference. First operand 3058 states and 9411 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:23,580 INFO L93 Difference]: Finished difference Result 3130 states and 9553 transitions. [2021-11-03 05:30:23,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:23,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:23,586 INFO L225 Difference]: With dead ends: 3130 [2021-11-03 05:30:23,586 INFO L226 Difference]: Without dead ends: 3110 [2021-11-03 05:30:23,587 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:30:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2021-11-03 05:30:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3056. [2021-11-03 05:30:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3056 states, 3055 states have (on average 3.0782324058919803) internal successors, (9404), 3055 states have internal predecessors, (9404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 9404 transitions. [2021-11-03 05:30:23,647 INFO L78 Accepts]: Start accepts. Automaton has 3056 states and 9404 transitions. Word has length 32 [2021-11-03 05:30:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:23,647 INFO L470 AbstractCegarLoop]: Abstraction has 3056 states and 9404 transitions. [2021-11-03 05:30:23,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3056 states and 9404 transitions. [2021-11-03 05:30:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:23,654 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:23,654 INFO L513 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] [2021-11-03 05:30:23,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-03 05:30:23,654 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash -240074668, now seen corresponding path program 41 times [2021-11-03 05:30:23,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:23,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342453507] [2021-11-03 05:30:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:23,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:23,757 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:23,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342453507] [2021-11-03 05:30:23,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342453507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:23,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:23,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:23,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354998375] [2021-11-03 05:30:23,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:23,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:23,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:23,759 INFO L87 Difference]: Start difference. First operand 3056 states and 9404 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:23,949 INFO L93 Difference]: Finished difference Result 3064 states and 9388 transitions. [2021-11-03 05:30:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:23,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:23,956 INFO L225 Difference]: With dead ends: 3064 [2021-11-03 05:30:23,957 INFO L226 Difference]: Without dead ends: 3056 [2021-11-03 05:30:23,957 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2021-11-03 05:30:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 3008. [2021-11-03 05:30:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 3.086132357831726) internal successors, (9280), 3007 states have internal predecessors, (9280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 9280 transitions. [2021-11-03 05:30:24,077 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 9280 transitions. Word has length 32 [2021-11-03 05:30:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:24,078 INFO L470 AbstractCegarLoop]: Abstraction has 3008 states and 9280 transitions. [2021-11-03 05:30:24,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 9280 transitions. [2021-11-03 05:30:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:24,086 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:24,086 INFO L513 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] [2021-11-03 05:30:24,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-03 05:30:24,086 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1090485514, now seen corresponding path program 42 times [2021-11-03 05:30:24,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:24,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914582639] [2021-11-03 05:30:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:24,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:24,241 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:24,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914582639] [2021-11-03 05:30:24,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914582639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:24,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:24,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:24,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162554112] [2021-11-03 05:30:24,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:24,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:24,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:24,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:24,243 INFO L87 Difference]: Start difference. First operand 3008 states and 9280 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:24,634 INFO L93 Difference]: Finished difference Result 3222 states and 9722 transitions. [2021-11-03 05:30:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-03 05:30:24,634 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:24,643 INFO L225 Difference]: With dead ends: 3222 [2021-11-03 05:30:24,644 INFO L226 Difference]: Without dead ends: 3206 [2021-11-03 05:30:24,644 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:30:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2021-11-03 05:30:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 3002. [2021-11-03 05:30:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 3001 states have (on average 3.0873042319226927) internal successors, (9265), 3001 states have internal predecessors, (9265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 9265 transitions. [2021-11-03 05:30:24,732 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 9265 transitions. Word has length 32 [2021-11-03 05:30:24,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:24,733 INFO L470 AbstractCegarLoop]: Abstraction has 3002 states and 9265 transitions. [2021-11-03 05:30:24,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 9265 transitions. [2021-11-03 05:30:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:24,741 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:24,741 INFO L513 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] [2021-11-03 05:30:24,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-03 05:30:24,742 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2027476066, now seen corresponding path program 43 times [2021-11-03 05:30:24,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:24,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635103083] [2021-11-03 05:30:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:24,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:24,872 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:24,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635103083] [2021-11-03 05:30:24,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635103083] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:24,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:24,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:24,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537635160] [2021-11-03 05:30:24,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:24,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:24,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:24,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:24,876 INFO L87 Difference]: Start difference. First operand 3002 states and 9265 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:25,063 INFO L93 Difference]: Finished difference Result 3266 states and 9476 transitions. [2021-11-03 05:30:25,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:25,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:25,076 INFO L225 Difference]: With dead ends: 3266 [2021-11-03 05:30:25,077 INFO L226 Difference]: Without dead ends: 3250 [2021-11-03 05:30:25,078 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2021-11-03 05:30:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2574. [2021-11-03 05:30:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2574 states, 2573 states have (on average 2.950252623396813) internal successors, (7591), 2573 states have internal predecessors, (7591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 7591 transitions. [2021-11-03 05:30:25,149 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 7591 transitions. Word has length 32 [2021-11-03 05:30:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:25,151 INFO L470 AbstractCegarLoop]: Abstraction has 2574 states and 7591 transitions. [2021-11-03 05:30:25,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 7591 transitions. [2021-11-03 05:30:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:25,157 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:25,157 INFO L513 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] [2021-11-03 05:30:25,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-03 05:30:25,158 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:25,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1854073392, now seen corresponding path program 44 times [2021-11-03 05:30:25,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:25,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141994574] [2021-11-03 05:30:25,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:25,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:25,310 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:25,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141994574] [2021-11-03 05:30:25,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141994574] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:25,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:25,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:25,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185609937] [2021-11-03 05:30:25,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:25,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:25,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:25,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:25,312 INFO L87 Difference]: Start difference. First operand 2574 states and 7591 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:25,545 INFO L93 Difference]: Finished difference Result 3610 states and 10238 transitions. [2021-11-03 05:30:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:25,550 INFO L225 Difference]: With dead ends: 3610 [2021-11-03 05:30:25,551 INFO L226 Difference]: Without dead ends: 3582 [2021-11-03 05:30:25,551 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:30:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2021-11-03 05:30:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 2764. [2021-11-03 05:30:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 2.9250814332247557) internal successors, (8082), 2763 states have internal predecessors, (8082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 8082 transitions. [2021-11-03 05:30:25,603 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 8082 transitions. Word has length 32 [2021-11-03 05:30:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:25,603 INFO L470 AbstractCegarLoop]: Abstraction has 2764 states and 8082 transitions. [2021-11-03 05:30:25,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 8082 transitions. [2021-11-03 05:30:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:25,609 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:25,609 INFO L513 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] [2021-11-03 05:30:25,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-03 05:30:25,610 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:25,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2127407326, now seen corresponding path program 45 times [2021-11-03 05:30:25,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:25,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207001013] [2021-11-03 05:30:25,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:25,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:25,748 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:25,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207001013] [2021-11-03 05:30:25,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207001013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:25,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:25,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:25,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658829118] [2021-11-03 05:30:25,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:25,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:25,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:25,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:25,750 INFO L87 Difference]: Start difference. First operand 2764 states and 8082 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:25,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:25,974 INFO L93 Difference]: Finished difference Result 4146 states and 11499 transitions. [2021-11-03 05:30:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:25,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:25,984 INFO L225 Difference]: With dead ends: 4146 [2021-11-03 05:30:25,984 INFO L226 Difference]: Without dead ends: 4074 [2021-11-03 05:30:25,985 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4074 states. [2021-11-03 05:30:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4074 to 2790. [2021-11-03 05:30:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 2789 states have (on average 2.902115453567587) internal successors, (8094), 2789 states have internal predecessors, (8094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 8094 transitions. [2021-11-03 05:30:26,069 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 8094 transitions. Word has length 32 [2021-11-03 05:30:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:26,070 INFO L470 AbstractCegarLoop]: Abstraction has 2790 states and 8094 transitions. [2021-11-03 05:30:26,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 8094 transitions. [2021-11-03 05:30:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:26,075 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:26,076 INFO L513 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] [2021-11-03 05:30:26,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-03 05:30:26,076 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1087838384, now seen corresponding path program 46 times [2021-11-03 05:30:26,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:26,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943735812] [2021-11-03 05:30:26,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:26,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:26,214 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:26,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943735812] [2021-11-03 05:30:26,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943735812] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:26,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:26,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:26,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264037963] [2021-11-03 05:30:26,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:26,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:26,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:26,217 INFO L87 Difference]: Start difference. First operand 2790 states and 8094 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:26,468 INFO L93 Difference]: Finished difference Result 3942 states and 10884 transitions. [2021-11-03 05:30:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:26,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:26,477 INFO L225 Difference]: With dead ends: 3942 [2021-11-03 05:30:26,477 INFO L226 Difference]: Without dead ends: 3922 [2021-11-03 05:30:26,478 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2021-11-03 05:30:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 2716. [2021-11-03 05:30:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2715 states have (on average 2.8644567219152854) internal successors, (7777), 2715 states have internal predecessors, (7777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 7777 transitions. [2021-11-03 05:30:26,551 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 7777 transitions. Word has length 32 [2021-11-03 05:30:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:26,551 INFO L470 AbstractCegarLoop]: Abstraction has 2716 states and 7777 transitions. [2021-11-03 05:30:26,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 7777 transitions. [2021-11-03 05:30:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:26,556 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:26,556 INFO L513 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] [2021-11-03 05:30:26,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-03 05:30:26,557 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:26,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:26,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1388759350, now seen corresponding path program 47 times [2021-11-03 05:30:26,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:26,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354284012] [2021-11-03 05:30:26,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:26,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:26,687 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:26,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354284012] [2021-11-03 05:30:26,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354284012] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:26,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:26,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:26,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537858497] [2021-11-03 05:30:26,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:26,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:26,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:26,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:26,690 INFO L87 Difference]: Start difference. First operand 2716 states and 7777 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:26,936 INFO L93 Difference]: Finished difference Result 3856 states and 10482 transitions. [2021-11-03 05:30:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:26,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:26,945 INFO L225 Difference]: With dead ends: 3856 [2021-11-03 05:30:26,946 INFO L226 Difference]: Without dead ends: 3798 [2021-11-03 05:30:26,946 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2021-11-03 05:30:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 2832. [2021-11-03 05:30:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2832 states, 2831 states have (on average 2.829742140586365) internal successors, (8011), 2831 states have internal predecessors, (8011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 8011 transitions. [2021-11-03 05:30:27,021 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 8011 transitions. Word has length 32 [2021-11-03 05:30:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:27,022 INFO L470 AbstractCegarLoop]: Abstraction has 2832 states and 8011 transitions. [2021-11-03 05:30:27,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 8011 transitions. [2021-11-03 05:30:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:27,027 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:27,028 INFO L513 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] [2021-11-03 05:30:27,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-03 05:30:27,028 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1664648368, now seen corresponding path program 48 times [2021-11-03 05:30:27,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:27,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773586691] [2021-11-03 05:30:27,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:27,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:27,186 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:27,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773586691] [2021-11-03 05:30:27,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773586691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:27,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:27,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:27,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783336264] [2021-11-03 05:30:27,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:27,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:27,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:27,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:27,188 INFO L87 Difference]: Start difference. First operand 2832 states and 8011 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:27,481 INFO L93 Difference]: Finished difference Result 3086 states and 8511 transitions. [2021-11-03 05:30:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:30:27,481 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:27,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:27,488 INFO L225 Difference]: With dead ends: 3086 [2021-11-03 05:30:27,488 INFO L226 Difference]: Without dead ends: 3038 [2021-11-03 05:30:27,488 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:30:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2021-11-03 05:30:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2856. [2021-11-03 05:30:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2855 states have (on average 2.819964973730298) internal successors, (8051), 2855 states have internal predecessors, (8051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 8051 transitions. [2021-11-03 05:30:27,552 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 8051 transitions. Word has length 32 [2021-11-03 05:30:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:27,552 INFO L470 AbstractCegarLoop]: Abstraction has 2856 states and 8051 transitions. [2021-11-03 05:30:27,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 8051 transitions. [2021-11-03 05:30:27,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:27,557 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:27,558 INFO L513 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] [2021-11-03 05:30:27,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-03 05:30:27,558 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:27,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1637263274, now seen corresponding path program 49 times [2021-11-03 05:30:27,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:27,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101233851] [2021-11-03 05:30:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:27,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:27,707 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:27,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101233851] [2021-11-03 05:30:27,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101233851] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:27,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:27,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:27,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74987031] [2021-11-03 05:30:27,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:27,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:27,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:27,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:27,711 INFO L87 Difference]: Start difference. First operand 2856 states and 8051 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:27,959 INFO L93 Difference]: Finished difference Result 4092 states and 11087 transitions. [2021-11-03 05:30:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:27,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:27,968 INFO L225 Difference]: With dead ends: 4092 [2021-11-03 05:30:27,968 INFO L226 Difference]: Without dead ends: 4048 [2021-11-03 05:30:27,969 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2021-11-03 05:30:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 2818. [2021-11-03 05:30:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2817 states have (on average 2.8189563365282213) internal successors, (7941), 2817 states have internal predecessors, (7941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 7941 transitions. [2021-11-03 05:30:28,042 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 7941 transitions. Word has length 32 [2021-11-03 05:30:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:28,042 INFO L470 AbstractCegarLoop]: Abstraction has 2818 states and 7941 transitions. [2021-11-03 05:30:28,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 7941 transitions. [2021-11-03 05:30:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:28,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:28,048 INFO L513 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] [2021-11-03 05:30:28,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-03 05:30:28,048 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:28,049 INFO L85 PathProgramCache]: Analyzing trace with hash -235003082, now seen corresponding path program 50 times [2021-11-03 05:30:28,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:28,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139974712] [2021-11-03 05:30:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:28,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:28,183 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:28,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139974712] [2021-11-03 05:30:28,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139974712] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:28,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:28,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:28,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83002849] [2021-11-03 05:30:28,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:28,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:28,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:28,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:28,185 INFO L87 Difference]: Start difference. First operand 2818 states and 7941 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:28,415 INFO L93 Difference]: Finished difference Result 2900 states and 8088 transitions. [2021-11-03 05:30:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:28,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:28,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:28,422 INFO L225 Difference]: With dead ends: 2900 [2021-11-03 05:30:28,422 INFO L226 Difference]: Without dead ends: 2858 [2021-11-03 05:30:28,422 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:30:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2021-11-03 05:30:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2814. [2021-11-03 05:30:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2813 states have (on average 2.8165659438322077) internal successors, (7923), 2813 states have internal predecessors, (7923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 7923 transitions. [2021-11-03 05:30:28,484 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 7923 transitions. Word has length 32 [2021-11-03 05:30:28,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:28,484 INFO L470 AbstractCegarLoop]: Abstraction has 2814 states and 7923 transitions. [2021-11-03 05:30:28,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 7923 transitions. [2021-11-03 05:30:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:28,490 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:28,490 INFO L513 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] [2021-11-03 05:30:28,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-03 05:30:28,491 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:28,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1533134866, now seen corresponding path program 51 times [2021-11-03 05:30:28,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:28,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986888389] [2021-11-03 05:30:28,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:28,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:28,670 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:28,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986888389] [2021-11-03 05:30:28,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986888389] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:28,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:28,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:28,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502387328] [2021-11-03 05:30:28,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:28,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:28,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:28,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:28,672 INFO L87 Difference]: Start difference. First operand 2814 states and 7923 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:28,910 INFO L93 Difference]: Finished difference Result 2904 states and 8091 transitions. [2021-11-03 05:30:28,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:30:28,910 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:28,916 INFO L225 Difference]: With dead ends: 2904 [2021-11-03 05:30:28,916 INFO L226 Difference]: Without dead ends: 2874 [2021-11-03 05:30:28,917 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:30:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2021-11-03 05:30:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2814. [2021-11-03 05:30:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2813 states have (on average 2.8123000355492356) internal successors, (7911), 2813 states have internal predecessors, (7911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 7911 transitions. [2021-11-03 05:30:28,973 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 7911 transitions. Word has length 32 [2021-11-03 05:30:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:28,974 INFO L470 AbstractCegarLoop]: Abstraction has 2814 states and 7911 transitions. [2021-11-03 05:30:28,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 7911 transitions. [2021-11-03 05:30:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:28,980 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:28,980 INFO L513 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] [2021-11-03 05:30:28,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-03 05:30:28,980 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:28,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1321440736, now seen corresponding path program 52 times [2021-11-03 05:30:28,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:28,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116453803] [2021-11-03 05:30:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:28,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:29,129 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:29,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116453803] [2021-11-03 05:30:29,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116453803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:29,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:29,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:29,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836462358] [2021-11-03 05:30:29,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:29,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:29,132 INFO L87 Difference]: Start difference. First operand 2814 states and 7911 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:29,371 INFO L93 Difference]: Finished difference Result 2990 states and 8267 transitions. [2021-11-03 05:30:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:29,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:29,377 INFO L225 Difference]: With dead ends: 2990 [2021-11-03 05:30:29,378 INFO L226 Difference]: Without dead ends: 2972 [2021-11-03 05:30:29,379 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:30:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2021-11-03 05:30:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2822. [2021-11-03 05:30:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2821 states have (on average 2.8085785182559375) internal successors, (7923), 2821 states have internal predecessors, (7923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 7923 transitions. [2021-11-03 05:30:29,441 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 7923 transitions. Word has length 32 [2021-11-03 05:30:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:29,442 INFO L470 AbstractCegarLoop]: Abstraction has 2822 states and 7923 transitions. [2021-11-03 05:30:29,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 7923 transitions. [2021-11-03 05:30:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:29,447 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:29,447 INFO L513 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] [2021-11-03 05:30:29,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-03 05:30:29,448 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:29,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash -540079212, now seen corresponding path program 53 times [2021-11-03 05:30:29,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:29,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542699034] [2021-11-03 05:30:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:29,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:29,598 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:29,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542699034] [2021-11-03 05:30:29,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542699034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:29,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:29,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:29,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175272447] [2021-11-03 05:30:29,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:29,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:29,600 INFO L87 Difference]: Start difference. First operand 2822 states and 7923 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:29,879 INFO L93 Difference]: Finished difference Result 3940 states and 10712 transitions. [2021-11-03 05:30:29,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:29,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:29,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:29,888 INFO L225 Difference]: With dead ends: 3940 [2021-11-03 05:30:29,888 INFO L226 Difference]: Without dead ends: 3888 [2021-11-03 05:30:29,888 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:30:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3888 states. [2021-11-03 05:30:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3888 to 2782. [2021-11-03 05:30:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2781 states have (on average 2.8216468896080547) internal successors, (7847), 2781 states have internal predecessors, (7847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 7847 transitions. [2021-11-03 05:30:29,960 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 7847 transitions. Word has length 32 [2021-11-03 05:30:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:29,961 INFO L470 AbstractCegarLoop]: Abstraction has 2782 states and 7847 transitions. [2021-11-03 05:30:29,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 7847 transitions. [2021-11-03 05:30:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:29,967 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:29,967 INFO L513 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] [2021-11-03 05:30:29,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-03 05:30:29,967 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash 944524744, now seen corresponding path program 54 times [2021-11-03 05:30:29,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:29,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844150693] [2021-11-03 05:30:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:29,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:30,067 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:30,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844150693] [2021-11-03 05:30:30,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844150693] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:30,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:30,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:30,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926803473] [2021-11-03 05:30:30,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:30,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:30,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:30,069 INFO L87 Difference]: Start difference. First operand 2782 states and 7847 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:30,290 INFO L93 Difference]: Finished difference Result 3838 states and 10307 transitions. [2021-11-03 05:30:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:30,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:30,295 INFO L225 Difference]: With dead ends: 3838 [2021-11-03 05:30:30,295 INFO L226 Difference]: Without dead ends: 3780 [2021-11-03 05:30:30,298 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2021-11-03 05:30:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2826. [2021-11-03 05:30:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2825 states have (on average 2.8102654867256636) internal successors, (7939), 2825 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 7939 transitions. [2021-11-03 05:30:30,370 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 7939 transitions. Word has length 32 [2021-11-03 05:30:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:30,371 INFO L470 AbstractCegarLoop]: Abstraction has 2826 states and 7939 transitions. [2021-11-03 05:30:30,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 7939 transitions. [2021-11-03 05:30:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:30,376 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:30,377 INFO L513 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] [2021-11-03 05:30:30,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-03 05:30:30,377 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash 572968058, now seen corresponding path program 55 times [2021-11-03 05:30:30,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:30,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721141559] [2021-11-03 05:30:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:30,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:30,507 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:30,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721141559] [2021-11-03 05:30:30,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721141559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:30,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:30,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:30:30,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723993629] [2021-11-03 05:30:30,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:30:30,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:30,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:30:30,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:30,509 INFO L87 Difference]: Start difference. First operand 2826 states and 7939 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:30,665 INFO L93 Difference]: Finished difference Result 3962 states and 10577 transitions. [2021-11-03 05:30:30,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:30:30,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:30,674 INFO L225 Difference]: With dead ends: 3962 [2021-11-03 05:30:30,674 INFO L226 Difference]: Without dead ends: 3890 [2021-11-03 05:30:30,674 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2021-11-03 05:30:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 2766. [2021-11-03 05:30:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2765 states have (on average 2.7913200723327307) internal successors, (7718), 2765 states have internal predecessors, (7718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 7718 transitions. [2021-11-03 05:30:30,744 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 7718 transitions. Word has length 32 [2021-11-03 05:30:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:30,744 INFO L470 AbstractCegarLoop]: Abstraction has 2766 states and 7718 transitions. [2021-11-03 05:30:30,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 7718 transitions. [2021-11-03 05:30:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:30,771 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:30,772 INFO L513 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] [2021-11-03 05:30:30,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-03 05:30:30,772 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash 318301526, now seen corresponding path program 56 times [2021-11-03 05:30:30,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:30,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402582709] [2021-11-03 05:30:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:30,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:30,887 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:30,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402582709] [2021-11-03 05:30:30,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402582709] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:30,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:30,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:30,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275269376] [2021-11-03 05:30:30,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:30,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:30,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:30,889 INFO L87 Difference]: Start difference. First operand 2766 states and 7718 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:31,157 INFO L93 Difference]: Finished difference Result 4164 states and 10981 transitions. [2021-11-03 05:30:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:31,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:31,166 INFO L225 Difference]: With dead ends: 4164 [2021-11-03 05:30:31,167 INFO L226 Difference]: Without dead ends: 4148 [2021-11-03 05:30:31,167 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:30:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2021-11-03 05:30:31,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 2812. [2021-11-03 05:30:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2811 states have (on average 2.783706865884027) internal successors, (7825), 2811 states have internal predecessors, (7825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 7825 transitions. [2021-11-03 05:30:31,244 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 7825 transitions. Word has length 32 [2021-11-03 05:30:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:31,245 INFO L470 AbstractCegarLoop]: Abstraction has 2812 states and 7825 transitions. [2021-11-03 05:30:31,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 7825 transitions. [2021-11-03 05:30:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:31,250 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:31,250 INFO L513 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] [2021-11-03 05:30:31,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-03 05:30:31,250 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:31,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash -147012516, now seen corresponding path program 57 times [2021-11-03 05:30:31,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:31,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113588119] [2021-11-03 05:30:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:31,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:31,367 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:31,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113588119] [2021-11-03 05:30:31,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113588119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:31,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:31,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:31,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905717728] [2021-11-03 05:30:31,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:31,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:31,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:31,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:31,369 INFO L87 Difference]: Start difference. First operand 2812 states and 7825 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:31,616 INFO L93 Difference]: Finished difference Result 4190 states and 11072 transitions. [2021-11-03 05:30:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:31,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:31,625 INFO L225 Difference]: With dead ends: 4190 [2021-11-03 05:30:31,626 INFO L226 Difference]: Without dead ends: 4116 [2021-11-03 05:30:31,626 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2021-11-03 05:30:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 2834. [2021-11-03 05:30:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2834 states, 2833 states have (on average 2.7691493116837274) internal successors, (7845), 2833 states have internal predecessors, (7845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2834 states and 7845 transitions. [2021-11-03 05:30:31,700 INFO L78 Accepts]: Start accepts. Automaton has 2834 states and 7845 transitions. Word has length 32 [2021-11-03 05:30:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:31,701 INFO L470 AbstractCegarLoop]: Abstraction has 2834 states and 7845 transitions. [2021-11-03 05:30:31,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 7845 transitions. [2021-11-03 05:30:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:31,706 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:31,707 INFO L513 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] [2021-11-03 05:30:31,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-03 05:30:31,707 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:31,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1620207692, now seen corresponding path program 58 times [2021-11-03 05:30:31,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:31,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292570966] [2021-11-03 05:30:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:31,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:31,833 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:31,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292570966] [2021-11-03 05:30:31,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292570966] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:31,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:31,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:31,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766294408] [2021-11-03 05:30:31,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:31,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:31,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:31,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:31,837 INFO L87 Difference]: Start difference. First operand 2834 states and 7845 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:32,022 INFO L93 Difference]: Finished difference Result 4044 states and 10684 transitions. [2021-11-03 05:30:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:32,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:32,031 INFO L225 Difference]: With dead ends: 4044 [2021-11-03 05:30:32,031 INFO L226 Difference]: Without dead ends: 3980 [2021-11-03 05:30:32,031 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2021-11-03 05:30:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 2766. [2021-11-03 05:30:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2765 states have (on average 2.7584086799276673) internal successors, (7627), 2765 states have internal predecessors, (7627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 7627 transitions. [2021-11-03 05:30:32,106 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 7627 transitions. Word has length 32 [2021-11-03 05:30:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:32,106 INFO L470 AbstractCegarLoop]: Abstraction has 2766 states and 7627 transitions. [2021-11-03 05:30:32,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 7627 transitions. [2021-11-03 05:30:32,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:32,111 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:32,111 INFO L513 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] [2021-11-03 05:30:32,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-03 05:30:32,112 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash 412804950, now seen corresponding path program 59 times [2021-11-03 05:30:32,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:32,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031589123] [2021-11-03 05:30:32,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:32,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:32,222 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:32,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031589123] [2021-11-03 05:30:32,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031589123] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:32,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:32,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:32,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023170447] [2021-11-03 05:30:32,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:32,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:32,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:32,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:32,224 INFO L87 Difference]: Start difference. First operand 2766 states and 7627 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:32,488 INFO L93 Difference]: Finished difference Result 3914 states and 10258 transitions. [2021-11-03 05:30:32,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:32,489 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:32,496 INFO L225 Difference]: With dead ends: 3914 [2021-11-03 05:30:32,497 INFO L226 Difference]: Without dead ends: 3840 [2021-11-03 05:30:32,497 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:30:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2021-11-03 05:30:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 2602. [2021-11-03 05:30:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2601 states have (on average 2.7516339869281046) internal successors, (7157), 2601 states have internal predecessors, (7157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 7157 transitions. [2021-11-03 05:30:32,565 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 7157 transitions. Word has length 32 [2021-11-03 05:30:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:32,566 INFO L470 AbstractCegarLoop]: Abstraction has 2602 states and 7157 transitions. [2021-11-03 05:30:32,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 7157 transitions. [2021-11-03 05:30:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:32,571 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:32,571 INFO L513 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] [2021-11-03 05:30:32,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-03 05:30:32,572 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:32,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:32,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2141112964, now seen corresponding path program 60 times [2021-11-03 05:30:32,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:32,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326270610] [2021-11-03 05:30:32,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:32,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:32,708 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:32,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326270610] [2021-11-03 05:30:32,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326270610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:32,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:32,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:32,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151200257] [2021-11-03 05:30:32,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:32,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:32,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:32,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:32,710 INFO L87 Difference]: Start difference. First operand 2602 states and 7157 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:33,042 INFO L93 Difference]: Finished difference Result 4080 states and 10692 transitions. [2021-11-03 05:30:33,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 05:30:33,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:33,080 INFO L225 Difference]: With dead ends: 4080 [2021-11-03 05:30:33,080 INFO L226 Difference]: Without dead ends: 4040 [2021-11-03 05:30:33,080 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:30:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2021-11-03 05:30:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 2590. [2021-11-03 05:30:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2589 states have (on average 2.7412128234839708) internal successors, (7097), 2589 states have internal predecessors, (7097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 7097 transitions. [2021-11-03 05:30:33,163 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 7097 transitions. Word has length 32 [2021-11-03 05:30:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:33,163 INFO L470 AbstractCegarLoop]: Abstraction has 2590 states and 7097 transitions. [2021-11-03 05:30:33,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 7097 transitions. [2021-11-03 05:30:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:33,170 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:33,170 INFO L513 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] [2021-11-03 05:30:33,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-03 05:30:33,170 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1464104792, now seen corresponding path program 61 times [2021-11-03 05:30:33,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:33,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579954572] [2021-11-03 05:30:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:33,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:33,286 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:33,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579954572] [2021-11-03 05:30:33,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579954572] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:33,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:33,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:33,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274044327] [2021-11-03 05:30:33,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:33,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:33,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:33,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:33,288 INFO L87 Difference]: Start difference. First operand 2590 states and 7097 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:33,674 INFO L93 Difference]: Finished difference Result 4100 states and 10698 transitions. [2021-11-03 05:30:33,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 05:30:33,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:33,685 INFO L225 Difference]: With dead ends: 4100 [2021-11-03 05:30:33,685 INFO L226 Difference]: Without dead ends: 4060 [2021-11-03 05:30:33,685 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2021-11-03 05:30:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2021-11-03 05:30:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 2664. [2021-11-03 05:30:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2663 states have (on average 2.726248591813744) internal successors, (7260), 2663 states have internal predecessors, (7260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 7260 transitions. [2021-11-03 05:30:33,776 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 7260 transitions. Word has length 32 [2021-11-03 05:30:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:33,776 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 7260 transitions. [2021-11-03 05:30:33,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 7260 transitions. [2021-11-03 05:30:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:33,782 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:33,783 INFO L513 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] [2021-11-03 05:30:33,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-03 05:30:33,783 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash -75728622, now seen corresponding path program 62 times [2021-11-03 05:30:33,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:33,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290720869] [2021-11-03 05:30:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:33,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:33,895 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:33,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290720869] [2021-11-03 05:30:33,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290720869] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:33,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:33,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:33,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201603917] [2021-11-03 05:30:33,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:33,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:33,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:33,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:33,897 INFO L87 Difference]: Start difference. First operand 2664 states and 7260 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:34,216 INFO L93 Difference]: Finished difference Result 4340 states and 11240 transitions. [2021-11-03 05:30:34,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:34,216 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:34,222 INFO L225 Difference]: With dead ends: 4340 [2021-11-03 05:30:34,222 INFO L226 Difference]: Without dead ends: 4120 [2021-11-03 05:30:34,223 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:30:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2021-11-03 05:30:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 2610. [2021-11-03 05:30:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 2.684936757378306) internal successors, (7005), 2609 states have internal predecessors, (7005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 7005 transitions. [2021-11-03 05:30:34,268 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 7005 transitions. Word has length 32 [2021-11-03 05:30:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:34,268 INFO L470 AbstractCegarLoop]: Abstraction has 2610 states and 7005 transitions. [2021-11-03 05:30:34,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 7005 transitions. [2021-11-03 05:30:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:34,271 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:34,271 INFO L513 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] [2021-11-03 05:30:34,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-03 05:30:34,272 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:34,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:34,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1657582726, now seen corresponding path program 63 times [2021-11-03 05:30:34,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:34,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73065771] [2021-11-03 05:30:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:34,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:34,386 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:34,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73065771] [2021-11-03 05:30:34,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73065771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:34,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:34,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:34,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807880565] [2021-11-03 05:30:34,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:34,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:34,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:34,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:34,388 INFO L87 Difference]: Start difference. First operand 2610 states and 7005 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:34,642 INFO L93 Difference]: Finished difference Result 4206 states and 10821 transitions. [2021-11-03 05:30:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:34,651 INFO L225 Difference]: With dead ends: 4206 [2021-11-03 05:30:34,652 INFO L226 Difference]: Without dead ends: 4166 [2021-11-03 05:30:34,652 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2021-11-03 05:30:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 2670. [2021-11-03 05:30:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2669 states have (on average 2.684151367553391) internal successors, (7164), 2669 states have internal predecessors, (7164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 7164 transitions. [2021-11-03 05:30:34,718 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 7164 transitions. Word has length 32 [2021-11-03 05:30:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:34,719 INFO L470 AbstractCegarLoop]: Abstraction has 2670 states and 7164 transitions. [2021-11-03 05:30:34,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 7164 transitions. [2021-11-03 05:30:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:34,725 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:34,725 INFO L513 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] [2021-11-03 05:30:34,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-03 05:30:34,727 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash 375429916, now seen corresponding path program 64 times [2021-11-03 05:30:34,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:34,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865947918] [2021-11-03 05:30:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:34,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:34,842 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:34,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865947918] [2021-11-03 05:30:34,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865947918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:34,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:34,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:34,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133839802] [2021-11-03 05:30:34,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:34,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:34,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:34,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:34,846 INFO L87 Difference]: Start difference. First operand 2670 states and 7164 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:35,104 INFO L93 Difference]: Finished difference Result 4072 states and 10474 transitions. [2021-11-03 05:30:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 05:30:35,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:35,111 INFO L225 Difference]: With dead ends: 4072 [2021-11-03 05:30:35,111 INFO L226 Difference]: Without dead ends: 4012 [2021-11-03 05:30:35,111 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:30:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2021-11-03 05:30:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 2506. [2021-11-03 05:30:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 2.682235528942116) internal successors, (6719), 2505 states have internal predecessors, (6719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 6719 transitions. [2021-11-03 05:30:35,174 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 6719 transitions. Word has length 32 [2021-11-03 05:30:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:35,175 INFO L470 AbstractCegarLoop]: Abstraction has 2506 states and 6719 transitions. [2021-11-03 05:30:35,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:35,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 6719 transitions. [2021-11-03 05:30:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:35,180 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:35,180 INFO L513 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] [2021-11-03 05:30:35,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-03 05:30:35,180 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:35,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:35,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1251193688, now seen corresponding path program 65 times [2021-11-03 05:30:35,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:35,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751605289] [2021-11-03 05:30:35,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:35,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:35,300 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:35,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751605289] [2021-11-03 05:30:35,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751605289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:35,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:35,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:35,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139735355] [2021-11-03 05:30:35,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:35,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:35,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:35,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:35,302 INFO L87 Difference]: Start difference. First operand 2506 states and 6719 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:35,673 INFO L93 Difference]: Finished difference Result 3838 states and 9921 transitions. [2021-11-03 05:30:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 05:30:35,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:35,679 INFO L225 Difference]: With dead ends: 3838 [2021-11-03 05:30:35,679 INFO L226 Difference]: Without dead ends: 3770 [2021-11-03 05:30:35,679 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2021-11-03 05:30:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3770 states. [2021-11-03 05:30:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3770 to 2482. [2021-11-03 05:30:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 2481 states have (on average 2.6807738814993956) internal successors, (6651), 2481 states have internal predecessors, (6651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 6651 transitions. [2021-11-03 05:30:35,721 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 6651 transitions. Word has length 32 [2021-11-03 05:30:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:35,721 INFO L470 AbstractCegarLoop]: Abstraction has 2482 states and 6651 transitions. [2021-11-03 05:30:35,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 6651 transitions. [2021-11-03 05:30:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:35,724 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:35,725 INFO L513 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] [2021-11-03 05:30:35,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-03 05:30:35,725 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:35,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1153838036, now seen corresponding path program 66 times [2021-11-03 05:30:35,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:35,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793184600] [2021-11-03 05:30:35,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:35,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:35,883 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:35,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793184600] [2021-11-03 05:30:35,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793184600] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:35,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:35,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:35,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444203092] [2021-11-03 05:30:35,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:35,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:35,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:35,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:35,885 INFO L87 Difference]: Start difference. First operand 2482 states and 6651 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:36,163 INFO L93 Difference]: Finished difference Result 2520 states and 6716 transitions. [2021-11-03 05:30:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:36,164 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:36,168 INFO L225 Difference]: With dead ends: 2520 [2021-11-03 05:30:36,169 INFO L226 Difference]: Without dead ends: 2504 [2021-11-03 05:30:36,169 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:30:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2021-11-03 05:30:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2480. [2021-11-03 05:30:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2479 states have (on average 2.6801129487696653) internal successors, (6644), 2479 states have internal predecessors, (6644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 6644 transitions. [2021-11-03 05:30:36,216 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 6644 transitions. Word has length 32 [2021-11-03 05:30:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:36,217 INFO L470 AbstractCegarLoop]: Abstraction has 2480 states and 6644 transitions. [2021-11-03 05:30:36,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 6644 transitions. [2021-11-03 05:30:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:36,221 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:36,221 INFO L513 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] [2021-11-03 05:30:36,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-03 05:30:36,222 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash -417235532, now seen corresponding path program 67 times [2021-11-03 05:30:36,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:36,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498008212] [2021-11-03 05:30:36,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:36,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:36,348 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:36,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498008212] [2021-11-03 05:30:36,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498008212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:36,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:36,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:36,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070138191] [2021-11-03 05:30:36,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:36,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:36,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:36,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:36,350 INFO L87 Difference]: Start difference. First operand 2480 states and 6644 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:36,670 INFO L93 Difference]: Finished difference Result 3920 states and 10083 transitions. [2021-11-03 05:30:36,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 05:30:36,671 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:36,678 INFO L225 Difference]: With dead ends: 3920 [2021-11-03 05:30:36,678 INFO L226 Difference]: Without dead ends: 3908 [2021-11-03 05:30:36,680 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:30:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2021-11-03 05:30:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 2508. [2021-11-03 05:30:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 2507 states have (on average 2.672118069405664) internal successors, (6699), 2507 states have internal predecessors, (6699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 6699 transitions. [2021-11-03 05:30:36,734 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 6699 transitions. Word has length 32 [2021-11-03 05:30:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:36,734 INFO L470 AbstractCegarLoop]: Abstraction has 2508 states and 6699 transitions. [2021-11-03 05:30:36,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 6699 transitions. [2021-11-03 05:30:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:36,737 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:36,737 INFO L513 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] [2021-11-03 05:30:36,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-03 05:30:36,738 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:36,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1615777110, now seen corresponding path program 68 times [2021-11-03 05:30:36,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:36,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019211395] [2021-11-03 05:30:36,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:36,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:36,883 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:36,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019211395] [2021-11-03 05:30:36,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019211395] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:36,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:36,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:36,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362347942] [2021-11-03 05:30:36,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:36,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:36,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:36,884 INFO L87 Difference]: Start difference. First operand 2508 states and 6699 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:37,203 INFO L93 Difference]: Finished difference Result 2662 states and 6989 transitions. [2021-11-03 05:30:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:37,204 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:37,207 INFO L225 Difference]: With dead ends: 2662 [2021-11-03 05:30:37,207 INFO L226 Difference]: Without dead ends: 2646 [2021-11-03 05:30:37,208 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:30:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2021-11-03 05:30:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2492. [2021-11-03 05:30:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2491 states have (on average 2.67482938578884) internal successors, (6663), 2491 states have internal predecessors, (6663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 6663 transitions. [2021-11-03 05:30:37,240 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 6663 transitions. Word has length 32 [2021-11-03 05:30:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:37,241 INFO L470 AbstractCegarLoop]: Abstraction has 2492 states and 6663 transitions. [2021-11-03 05:30:37,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 6663 transitions. [2021-11-03 05:30:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:37,243 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:37,244 INFO L513 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] [2021-11-03 05:30:37,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-03 05:30:37,244 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:37,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1803426414, now seen corresponding path program 69 times [2021-11-03 05:30:37,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:37,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711672288] [2021-11-03 05:30:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:37,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:37,375 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:37,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711672288] [2021-11-03 05:30:37,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711672288] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:37,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:37,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:37,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502309018] [2021-11-03 05:30:37,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:37,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:37,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:37,377 INFO L87 Difference]: Start difference. First operand 2492 states and 6663 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:37,666 INFO L93 Difference]: Finished difference Result 2550 states and 6766 transitions. [2021-11-03 05:30:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 05:30:37,666 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:37,670 INFO L225 Difference]: With dead ends: 2550 [2021-11-03 05:30:37,670 INFO L226 Difference]: Without dead ends: 2522 [2021-11-03 05:30:37,670 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:30:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2021-11-03 05:30:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2472. [2021-11-03 05:30:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2471 states have (on average 2.679886685552408) internal successors, (6622), 2471 states have internal predecessors, (6622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 6622 transitions. [2021-11-03 05:30:37,702 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 6622 transitions. Word has length 32 [2021-11-03 05:30:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:37,702 INFO L470 AbstractCegarLoop]: Abstraction has 2472 states and 6622 transitions. [2021-11-03 05:30:37,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 6622 transitions. [2021-11-03 05:30:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:37,705 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:37,705 INFO L513 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] [2021-11-03 05:30:37,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-03 05:30:37,705 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:37,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1802251618, now seen corresponding path program 70 times [2021-11-03 05:30:37,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:37,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043383857] [2021-11-03 05:30:37,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:37,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:37,813 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:37,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043383857] [2021-11-03 05:30:37,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043383857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:37,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:37,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:37,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128007721] [2021-11-03 05:30:37,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:37,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:37,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:37,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:37,815 INFO L87 Difference]: Start difference. First operand 2472 states and 6622 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:38,010 INFO L93 Difference]: Finished difference Result 3764 states and 9695 transitions. [2021-11-03 05:30:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:38,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:38,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:38,017 INFO L225 Difference]: With dead ends: 3764 [2021-11-03 05:30:38,017 INFO L226 Difference]: Without dead ends: 3720 [2021-11-03 05:30:38,017 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3720 states. [2021-11-03 05:30:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 2440. [2021-11-03 05:30:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2439 states have (on average 2.6888068880688807) internal successors, (6558), 2439 states have internal predecessors, (6558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 6558 transitions. [2021-11-03 05:30:38,058 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 6558 transitions. Word has length 32 [2021-11-03 05:30:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:38,058 INFO L470 AbstractCegarLoop]: Abstraction has 2440 states and 6558 transitions. [2021-11-03 05:30:38,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 6558 transitions. [2021-11-03 05:30:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:38,065 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:38,065 INFO L513 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] [2021-11-03 05:30:38,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-03 05:30:38,066 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:38,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:38,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1949921050, now seen corresponding path program 71 times [2021-11-03 05:30:38,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:38,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825044196] [2021-11-03 05:30:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:38,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:38,201 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:38,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825044196] [2021-11-03 05:30:38,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825044196] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:38,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:38,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:38,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868720585] [2021-11-03 05:30:38,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:38,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:38,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:38,203 INFO L87 Difference]: Start difference. First operand 2440 states and 6558 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:38,355 INFO L93 Difference]: Finished difference Result 2490 states and 6634 transitions. [2021-11-03 05:30:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:30:38,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:38,361 INFO L225 Difference]: With dead ends: 2490 [2021-11-03 05:30:38,361 INFO L226 Difference]: Without dead ends: 2434 [2021-11-03 05:30:38,361 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2021-11-03 05:30:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2430. [2021-11-03 05:30:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2429 states have (on average 2.6875257307533964) internal successors, (6528), 2429 states have internal predecessors, (6528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 6528 transitions. [2021-11-03 05:30:38,410 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 6528 transitions. Word has length 32 [2021-11-03 05:30:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:38,410 INFO L470 AbstractCegarLoop]: Abstraction has 2430 states and 6528 transitions. [2021-11-03 05:30:38,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 6528 transitions. [2021-11-03 05:30:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:38,414 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:38,415 INFO L513 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] [2021-11-03 05:30:38,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-03 05:30:38,415 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:38,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:38,416 INFO L85 PathProgramCache]: Analyzing trace with hash 552258500, now seen corresponding path program 72 times [2021-11-03 05:30:38,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:38,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406478951] [2021-11-03 05:30:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:38,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:38,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:38,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406478951] [2021-11-03 05:30:38,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406478951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:38,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:38,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:38,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937201794] [2021-11-03 05:30:38,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:38,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:38,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:38,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:38,527 INFO L87 Difference]: Start difference. First operand 2430 states and 6528 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:38,672 INFO L93 Difference]: Finished difference Result 2488 states and 6624 transitions. [2021-11-03 05:30:38,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:38,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:38,704 INFO L225 Difference]: With dead ends: 2488 [2021-11-03 05:30:38,704 INFO L226 Difference]: Without dead ends: 2446 [2021-11-03 05:30:38,704 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2021-11-03 05:30:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2438. [2021-11-03 05:30:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2438 states, 2437 states have (on average 2.682806729585556) internal successors, (6538), 2437 states have internal predecessors, (6538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 6538 transitions. [2021-11-03 05:30:38,748 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 6538 transitions. Word has length 32 [2021-11-03 05:30:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:38,748 INFO L470 AbstractCegarLoop]: Abstraction has 2438 states and 6538 transitions. [2021-11-03 05:30:38,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 6538 transitions. [2021-11-03 05:30:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:38,752 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:38,753 INFO L513 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] [2021-11-03 05:30:38,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-11-03 05:30:38,753 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:38,754 INFO L85 PathProgramCache]: Analyzing trace with hash -340598966, now seen corresponding path program 73 times [2021-11-03 05:30:38,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:38,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705912396] [2021-11-03 05:30:38,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:38,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:38,862 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:38,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705912396] [2021-11-03 05:30:38,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705912396] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:38,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:38,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:38,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227141247] [2021-11-03 05:30:38,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:38,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:38,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:38,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:38,864 INFO L87 Difference]: Start difference. First operand 2438 states and 6538 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:39,056 INFO L93 Difference]: Finished difference Result 3546 states and 9068 transitions. [2021-11-03 05:30:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:39,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:39,063 INFO L225 Difference]: With dead ends: 3546 [2021-11-03 05:30:39,063 INFO L226 Difference]: Without dead ends: 3450 [2021-11-03 05:30:39,064 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2021-11-03 05:30:39,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 2488. [2021-11-03 05:30:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 2.6578206674708484) internal successors, (6610), 2487 states have internal predecessors, (6610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 6610 transitions. [2021-11-03 05:30:39,123 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 6610 transitions. Word has length 32 [2021-11-03 05:30:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:39,123 INFO L470 AbstractCegarLoop]: Abstraction has 2488 states and 6610 transitions. [2021-11-03 05:30:39,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 6610 transitions. [2021-11-03 05:30:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:39,127 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:39,128 INFO L513 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] [2021-11-03 05:30:39,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-11-03 05:30:39,128 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 633182822, now seen corresponding path program 74 times [2021-11-03 05:30:39,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:39,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845775315] [2021-11-03 05:30:39,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:39,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:39,228 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:39,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845775315] [2021-11-03 05:30:39,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845775315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:39,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:39,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:39,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989898072] [2021-11-03 05:30:39,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:39,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:39,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:39,230 INFO L87 Difference]: Start difference. First operand 2488 states and 6610 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:39,508 INFO L93 Difference]: Finished difference Result 3434 states and 8474 transitions. [2021-11-03 05:30:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:39,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:39,515 INFO L225 Difference]: With dead ends: 3434 [2021-11-03 05:30:39,515 INFO L226 Difference]: Without dead ends: 3334 [2021-11-03 05:30:39,516 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2021-11-03 05:30:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2336. [2021-11-03 05:30:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2335 states have (on average 2.5880085653104925) internal successors, (6043), 2335 states have internal predecessors, (6043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 6043 transitions. [2021-11-03 05:30:39,570 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 6043 transitions. Word has length 32 [2021-11-03 05:30:39,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:39,571 INFO L470 AbstractCegarLoop]: Abstraction has 2336 states and 6043 transitions. [2021-11-03 05:30:39,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 6043 transitions. [2021-11-03 05:30:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:39,575 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:39,575 INFO L513 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] [2021-11-03 05:30:39,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-03 05:30:39,576 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1441257480, now seen corresponding path program 75 times [2021-11-03 05:30:39,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:39,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968282291] [2021-11-03 05:30:39,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:39,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:39,671 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:39,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968282291] [2021-11-03 05:30:39,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968282291] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:39,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:39,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:30:39,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744532483] [2021-11-03 05:30:39,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:30:39,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:39,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:30:39,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:30:39,673 INFO L87 Difference]: Start difference. First operand 2336 states and 6043 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:39,826 INFO L93 Difference]: Finished difference Result 3512 states and 8735 transitions. [2021-11-03 05:30:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:30:39,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:39,834 INFO L225 Difference]: With dead ends: 3512 [2021-11-03 05:30:39,834 INFO L226 Difference]: Without dead ends: 3454 [2021-11-03 05:30:39,834 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2021-11-03 05:30:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 2336. [2021-11-03 05:30:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2335 states have (on average 2.5880085653104925) internal successors, (6043), 2335 states have internal predecessors, (6043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 6043 transitions. [2021-11-03 05:30:39,891 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 6043 transitions. Word has length 32 [2021-11-03 05:30:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:39,891 INFO L470 AbstractCegarLoop]: Abstraction has 2336 states and 6043 transitions. [2021-11-03 05:30:39,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 6043 transitions. [2021-11-03 05:30:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:39,896 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:39,896 INFO L513 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] [2021-11-03 05:30:39,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-03 05:30:39,897 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:39,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1631483022, now seen corresponding path program 76 times [2021-11-03 05:30:39,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:39,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530098452] [2021-11-03 05:30:39,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:39,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:40,010 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:40,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530098452] [2021-11-03 05:30:40,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530098452] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:40,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:40,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:40,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982752457] [2021-11-03 05:30:40,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:40,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:40,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:40,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:40,012 INFO L87 Difference]: Start difference. First operand 2336 states and 6043 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:40,216 INFO L93 Difference]: Finished difference Result 3596 states and 8865 transitions. [2021-11-03 05:30:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:40,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:40,224 INFO L225 Difference]: With dead ends: 3596 [2021-11-03 05:30:40,224 INFO L226 Difference]: Without dead ends: 3512 [2021-11-03 05:30:40,224 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2021-11-03 05:30:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 2336. [2021-11-03 05:30:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2335 states have (on average 2.5738758029978586) internal successors, (6010), 2335 states have internal predecessors, (6010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 6010 transitions. [2021-11-03 05:30:40,278 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 6010 transitions. Word has length 32 [2021-11-03 05:30:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:40,278 INFO L470 AbstractCegarLoop]: Abstraction has 2336 states and 6010 transitions. [2021-11-03 05:30:40,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 6010 transitions. [2021-11-03 05:30:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:40,281 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:40,281 INFO L513 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] [2021-11-03 05:30:40,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-03 05:30:40,282 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1743466252, now seen corresponding path program 77 times [2021-11-03 05:30:40,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:40,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018633172] [2021-11-03 05:30:40,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:40,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:40,391 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:40,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018633172] [2021-11-03 05:30:40,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018633172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:40,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:40,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:40,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210670433] [2021-11-03 05:30:40,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:40,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:40,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:40,393 INFO L87 Difference]: Start difference. First operand 2336 states and 6010 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:40,665 INFO L93 Difference]: Finished difference Result 3492 states and 8532 transitions. [2021-11-03 05:30:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:40,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:40,673 INFO L225 Difference]: With dead ends: 3492 [2021-11-03 05:30:40,673 INFO L226 Difference]: Without dead ends: 3396 [2021-11-03 05:30:40,673 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2021-11-03 05:30:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 2256. [2021-11-03 05:30:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 2.55609756097561) internal successors, (5764), 2255 states have internal predecessors, (5764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 5764 transitions. [2021-11-03 05:30:40,730 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 5764 transitions. Word has length 32 [2021-11-03 05:30:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:40,730 INFO L470 AbstractCegarLoop]: Abstraction has 2256 states and 5764 transitions. [2021-11-03 05:30:40,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 5764 transitions. [2021-11-03 05:30:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:40,734 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:40,734 INFO L513 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] [2021-11-03 05:30:40,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-03 05:30:40,735 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:40,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash -15330240, now seen corresponding path program 78 times [2021-11-03 05:30:40,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:40,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022447604] [2021-11-03 05:30:40,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:40,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:40,837 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:40,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022447604] [2021-11-03 05:30:40,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022447604] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:40,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:40,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:40,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437299418] [2021-11-03 05:30:40,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:40,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:40,838 INFO L87 Difference]: Start difference. First operand 2256 states and 5764 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:41,151 INFO L93 Difference]: Finished difference Result 3544 states and 8559 transitions. [2021-11-03 05:30:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:30:41,151 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:41,155 INFO L225 Difference]: With dead ends: 3544 [2021-11-03 05:30:41,155 INFO L226 Difference]: Without dead ends: 3332 [2021-11-03 05:30:41,155 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:30:41,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2021-11-03 05:30:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 2116. [2021-11-03 05:30:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 2115 states have (on average 2.541843971631206) internal successors, (5376), 2115 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 5376 transitions. [2021-11-03 05:30:41,189 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 5376 transitions. Word has length 32 [2021-11-03 05:30:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:41,189 INFO L470 AbstractCegarLoop]: Abstraction has 2116 states and 5376 transitions. [2021-11-03 05:30:41,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 5376 transitions. [2021-11-03 05:30:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:41,191 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:41,192 INFO L513 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] [2021-11-03 05:30:41,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-03 05:30:41,192 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:41,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1609813328, now seen corresponding path program 79 times [2021-11-03 05:30:41,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:41,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809324688] [2021-11-03 05:30:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:41,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:41,362 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:41,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809324688] [2021-11-03 05:30:41,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809324688] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:41,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:41,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:41,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893651570] [2021-11-03 05:30:41,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:41,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:41,364 INFO L87 Difference]: Start difference. First operand 2116 states and 5376 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:41,473 INFO L93 Difference]: Finished difference Result 2128 states and 5392 transitions. [2021-11-03 05:30:41,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:41,473 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:41,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:41,477 INFO L225 Difference]: With dead ends: 2128 [2021-11-03 05:30:41,477 INFO L226 Difference]: Without dead ends: 2112 [2021-11-03 05:30:41,478 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2021-11-03 05:30:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2112. [2021-11-03 05:30:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 2111 states have (on average 2.541923259118901) internal successors, (5366), 2111 states have internal predecessors, (5366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 5366 transitions. [2021-11-03 05:30:41,517 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 5366 transitions. Word has length 32 [2021-11-03 05:30:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:41,517 INFO L470 AbstractCegarLoop]: Abstraction has 2112 states and 5366 transitions. [2021-11-03 05:30:41,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 5366 transitions. [2021-11-03 05:30:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:41,520 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:41,521 INFO L513 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] [2021-11-03 05:30:41,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-11-03 05:30:41,521 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1225016954, now seen corresponding path program 80 times [2021-11-03 05:30:41,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:41,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790357864] [2021-11-03 05:30:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:41,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:41,669 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:41,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790357864] [2021-11-03 05:30:41,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790357864] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:41,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:41,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:41,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506604227] [2021-11-03 05:30:41,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:41,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:41,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:41,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:41,670 INFO L87 Difference]: Start difference. First operand 2112 states and 5366 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:41,793 INFO L93 Difference]: Finished difference Result 2128 states and 5392 transitions. [2021-11-03 05:30:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:41,793 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:41,796 INFO L225 Difference]: With dead ends: 2128 [2021-11-03 05:30:41,796 INFO L226 Difference]: Without dead ends: 2116 [2021-11-03 05:30:41,796 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2021-11-03 05:30:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2116. [2021-11-03 05:30:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 2115 states have (on average 2.539952718676123) internal successors, (5372), 2115 states have internal predecessors, (5372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 5372 transitions. [2021-11-03 05:30:41,820 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 5372 transitions. Word has length 32 [2021-11-03 05:30:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:41,820 INFO L470 AbstractCegarLoop]: Abstraction has 2116 states and 5372 transitions. [2021-11-03 05:30:41,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 5372 transitions. [2021-11-03 05:30:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:41,823 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:41,823 INFO L513 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] [2021-11-03 05:30:41,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-11-03 05:30:41,823 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:41,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:41,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1031103666, now seen corresponding path program 81 times [2021-11-03 05:30:41,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:41,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528264131] [2021-11-03 05:30:41,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:41,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:41,967 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:41,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528264131] [2021-11-03 05:30:41,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528264131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:41,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:41,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:41,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600372250] [2021-11-03 05:30:41,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:41,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:41,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:41,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:41,969 INFO L87 Difference]: Start difference. First operand 2116 states and 5372 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:42,164 INFO L93 Difference]: Finished difference Result 3332 states and 8062 transitions. [2021-11-03 05:30:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:42,166 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:42,172 INFO L225 Difference]: With dead ends: 3332 [2021-11-03 05:30:42,173 INFO L226 Difference]: Without dead ends: 3324 [2021-11-03 05:30:42,173 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2021-11-03 05:30:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 2120. [2021-11-03 05:30:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 2119 states have (on average 2.537989617744219) internal successors, (5378), 2119 states have internal predecessors, (5378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 5378 transitions. [2021-11-03 05:30:42,215 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 5378 transitions. Word has length 32 [2021-11-03 05:30:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:42,215 INFO L470 AbstractCegarLoop]: Abstraction has 2120 states and 5378 transitions. [2021-11-03 05:30:42,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 5378 transitions. [2021-11-03 05:30:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:42,217 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:42,217 INFO L513 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] [2021-11-03 05:30:42,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-11-03 05:30:42,217 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash 919120436, now seen corresponding path program 82 times [2021-11-03 05:30:42,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:42,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552146662] [2021-11-03 05:30:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:42,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:42,337 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:42,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552146662] [2021-11-03 05:30:42,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552146662] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:42,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:42,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:42,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69014262] [2021-11-03 05:30:42,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:42,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:42,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:42,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:42,339 INFO L87 Difference]: Start difference. First operand 2120 states and 5378 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:42,495 INFO L93 Difference]: Finished difference Result 2128 states and 5388 transitions. [2021-11-03 05:30:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:42,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:42,500 INFO L225 Difference]: With dead ends: 2128 [2021-11-03 05:30:42,500 INFO L226 Difference]: Without dead ends: 2108 [2021-11-03 05:30:42,500 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2021-11-03 05:30:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2108. [2021-11-03 05:30:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2107 states have (on average 2.5420028476506884) internal successors, (5356), 2107 states have internal predecessors, (5356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 5356 transitions. [2021-11-03 05:30:42,539 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 5356 transitions. Word has length 32 [2021-11-03 05:30:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:42,541 INFO L470 AbstractCegarLoop]: Abstraction has 2108 states and 5356 transitions. [2021-11-03 05:30:42,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 5356 transitions. [2021-11-03 05:30:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:42,545 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:42,545 INFO L513 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] [2021-11-03 05:30:42,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-11-03 05:30:42,546 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash 942651906, now seen corresponding path program 83 times [2021-11-03 05:30:42,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:42,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121398182] [2021-11-03 05:30:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:42,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:42,642 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:42,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121398182] [2021-11-03 05:30:42,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121398182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:42,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:42,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:42,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874569189] [2021-11-03 05:30:42,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:42,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:42,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:42,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:42,644 INFO L87 Difference]: Start difference. First operand 2108 states and 5356 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:42,847 INFO L93 Difference]: Finished difference Result 2784 states and 6743 transitions. [2021-11-03 05:30:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:42,847 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:42,850 INFO L225 Difference]: With dead ends: 2784 [2021-11-03 05:30:42,850 INFO L226 Difference]: Without dead ends: 2756 [2021-11-03 05:30:42,851 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2021-11-03 05:30:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 2088. [2021-11-03 05:30:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 2.548634403449928) internal successors, (5319), 2087 states have internal predecessors, (5319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 5319 transitions. [2021-11-03 05:30:42,881 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 5319 transitions. Word has length 32 [2021-11-03 05:30:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:42,881 INFO L470 AbstractCegarLoop]: Abstraction has 2088 states and 5319 transitions. [2021-11-03 05:30:42,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 5319 transitions. [2021-11-03 05:30:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:42,883 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:42,883 INFO L513 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] [2021-11-03 05:30:42,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-11-03 05:30:42,884 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:42,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:42,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2095903066, now seen corresponding path program 84 times [2021-11-03 05:30:42,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:42,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712058694] [2021-11-03 05:30:42,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:42,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:42,979 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:42,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712058694] [2021-11-03 05:30:42,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712058694] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:42,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:42,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:42,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677065000] [2021-11-03 05:30:42,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:42,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:42,980 INFO L87 Difference]: Start difference. First operand 2088 states and 5319 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:43,166 INFO L93 Difference]: Finished difference Result 3116 states and 7563 transitions. [2021-11-03 05:30:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:43,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:43,170 INFO L225 Difference]: With dead ends: 3116 [2021-11-03 05:30:43,170 INFO L226 Difference]: Without dead ends: 3108 [2021-11-03 05:30:43,171 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2021-11-03 05:30:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2008. [2021-11-03 05:30:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 2007 states have (on average 2.5346287992027903) internal successors, (5087), 2007 states have internal predecessors, (5087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 5087 transitions. [2021-11-03 05:30:43,201 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 5087 transitions. Word has length 32 [2021-11-03 05:30:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:43,201 INFO L470 AbstractCegarLoop]: Abstraction has 2008 states and 5087 transitions. [2021-11-03 05:30:43,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 5087 transitions. [2021-11-03 05:30:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:43,205 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:43,205 INFO L513 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] [2021-11-03 05:30:43,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-11-03 05:30:43,205 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:43,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash 337981120, now seen corresponding path program 85 times [2021-11-03 05:30:43,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:43,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600366611] [2021-11-03 05:30:43,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:43,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:43,303 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:43,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600366611] [2021-11-03 05:30:43,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600366611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:43,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:43,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:43,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404504637] [2021-11-03 05:30:43,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:43,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:43,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:43,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:43,305 INFO L87 Difference]: Start difference. First operand 2008 states and 5087 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:43,529 INFO L93 Difference]: Finished difference Result 3000 states and 7279 transitions. [2021-11-03 05:30:43,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:43,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:43,536 INFO L225 Difference]: With dead ends: 3000 [2021-11-03 05:30:43,536 INFO L226 Difference]: Without dead ends: 2984 [2021-11-03 05:30:43,537 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2021-11-03 05:30:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2036. [2021-11-03 05:30:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 2035 states have (on average 2.5321867321867324) internal successors, (5153), 2035 states have internal predecessors, (5153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 5153 transitions. [2021-11-03 05:30:43,583 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 5153 transitions. Word has length 32 [2021-11-03 05:30:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:43,584 INFO L470 AbstractCegarLoop]: Abstraction has 2036 states and 5153 transitions. [2021-11-03 05:30:43,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 5153 transitions. [2021-11-03 05:30:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:43,588 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:43,589 INFO L513 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] [2021-11-03 05:30:43,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-11-03 05:30:43,589 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash -339027052, now seen corresponding path program 86 times [2021-11-03 05:30:43,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:43,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102221652] [2021-11-03 05:30:43,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:43,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:43,715 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:43,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102221652] [2021-11-03 05:30:43,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102221652] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:43,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:43,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:43,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82706764] [2021-11-03 05:30:43,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:43,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:43,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:43,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:43,718 INFO L87 Difference]: Start difference. First operand 2036 states and 5153 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:44,072 INFO L93 Difference]: Finished difference Result 2964 states and 7178 transitions. [2021-11-03 05:30:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:44,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:44,079 INFO L225 Difference]: With dead ends: 2964 [2021-11-03 05:30:44,079 INFO L226 Difference]: Without dead ends: 2930 [2021-11-03 05:30:44,080 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:30:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2021-11-03 05:30:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1992. [2021-11-03 05:30:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1991 states have (on average 2.5248618784530388) internal successors, (5027), 1991 states have internal predecessors, (5027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 5027 transitions. [2021-11-03 05:30:44,141 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 5027 transitions. Word has length 32 [2021-11-03 05:30:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:44,142 INFO L470 AbstractCegarLoop]: Abstraction has 1992 states and 5027 transitions. [2021-11-03 05:30:44,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 5027 transitions. [2021-11-03 05:30:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:44,146 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:44,146 INFO L513 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] [2021-11-03 05:30:44,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-11-03 05:30:44,147 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:44,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:44,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1878860466, now seen corresponding path program 87 times [2021-11-03 05:30:44,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:44,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772325740] [2021-11-03 05:30:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:44,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:44,246 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:44,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772325740] [2021-11-03 05:30:44,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772325740] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:44,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:44,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:44,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129480275] [2021-11-03 05:30:44,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:44,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:44,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:44,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:44,249 INFO L87 Difference]: Start difference. First operand 1992 states and 5027 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:44,534 INFO L93 Difference]: Finished difference Result 2942 states and 7085 transitions. [2021-11-03 05:30:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:44,538 INFO L225 Difference]: With dead ends: 2942 [2021-11-03 05:30:44,538 INFO L226 Difference]: Without dead ends: 2688 [2021-11-03 05:30:44,539 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:30:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2021-11-03 05:30:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 1896. [2021-11-03 05:30:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1895 states have (on average 2.5102902374670184) internal successors, (4757), 1895 states have internal predecessors, (4757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 4757 transitions. [2021-11-03 05:30:44,575 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 4757 transitions. Word has length 32 [2021-11-03 05:30:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:44,575 INFO L470 AbstractCegarLoop]: Abstraction has 1896 states and 4757 transitions. [2021-11-03 05:30:44,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 4757 transitions. [2021-11-03 05:30:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:44,577 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:44,578 INFO L513 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] [2021-11-03 05:30:44,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-11-03 05:30:44,578 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:44,579 INFO L85 PathProgramCache]: Analyzing trace with hash 834252726, now seen corresponding path program 88 times [2021-11-03 05:30:44,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:44,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71595922] [2021-11-03 05:30:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:44,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:44,668 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:44,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71595922] [2021-11-03 05:30:44,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71595922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:44,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:44,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:44,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757162438] [2021-11-03 05:30:44,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:44,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:44,671 INFO L87 Difference]: Start difference. First operand 1896 states and 4757 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:44,906 INFO L93 Difference]: Finished difference Result 2806 states and 6703 transitions. [2021-11-03 05:30:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:30:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:44,913 INFO L225 Difference]: With dead ends: 2806 [2021-11-03 05:30:44,913 INFO L226 Difference]: Without dead ends: 2762 [2021-11-03 05:30:44,914 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2021-11-03 05:30:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 1934. [2021-11-03 05:30:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1933 states have (on average 2.49663735126746) internal successors, (4826), 1933 states have internal predecessors, (4826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 4826 transitions. [2021-11-03 05:30:44,972 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 4826 transitions. Word has length 32 [2021-11-03 05:30:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:44,972 INFO L470 AbstractCegarLoop]: Abstraction has 1934 states and 4826 transitions. [2021-11-03 05:30:44,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 4826 transitions. [2021-11-03 05:30:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:44,975 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:44,976 INFO L513 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] [2021-11-03 05:30:44,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-11-03 05:30:44,976 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1427701928, now seen corresponding path program 89 times [2021-11-03 05:30:44,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:44,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903777496] [2021-11-03 05:30:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:44,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:45,071 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:45,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903777496] [2021-11-03 05:30:45,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903777496] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:45,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:45,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 05:30:45,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35861875] [2021-11-03 05:30:45,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:30:45,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:45,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:30:45,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:30:45,074 INFO L87 Difference]: Start difference. First operand 1934 states and 4826 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:45,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:45,378 INFO L93 Difference]: Finished difference Result 2626 states and 6235 transitions. [2021-11-03 05:30:45,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:45,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:45,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:45,383 INFO L225 Difference]: With dead ends: 2626 [2021-11-03 05:30:45,383 INFO L226 Difference]: Without dead ends: 2604 [2021-11-03 05:30:45,383 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2021-11-03 05:30:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1882. [2021-11-03 05:30:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1881 states have (on average 2.4885699096225413) internal successors, (4681), 1881 states have internal predecessors, (4681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 4681 transitions. [2021-11-03 05:30:45,429 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 4681 transitions. Word has length 32 [2021-11-03 05:30:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:45,429 INFO L470 AbstractCegarLoop]: Abstraction has 1882 states and 4681 transitions. [2021-11-03 05:30:45,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 4681 transitions. [2021-11-03 05:30:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:45,432 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:45,432 INFO L513 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] [2021-11-03 05:30:45,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-11-03 05:30:45,433 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:45,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:45,433 INFO L85 PathProgramCache]: Analyzing trace with hash -551938156, now seen corresponding path program 90 times [2021-11-03 05:30:45,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:45,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640043536] [2021-11-03 05:30:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:45,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:45,556 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:45,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640043536] [2021-11-03 05:30:45,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640043536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:45,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:45,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:45,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269537689] [2021-11-03 05:30:45,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:45,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:45,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:45,558 INFO L87 Difference]: Start difference. First operand 1882 states and 4681 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:45,861 INFO L93 Difference]: Finished difference Result 2548 states and 6041 transitions. [2021-11-03 05:30:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:45,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:45,864 INFO L225 Difference]: With dead ends: 2548 [2021-11-03 05:30:45,864 INFO L226 Difference]: Without dead ends: 2470 [2021-11-03 05:30:45,864 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:30:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2021-11-03 05:30:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 1710. [2021-11-03 05:30:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1709 states have (on average 2.492100643651258) internal successors, (4259), 1709 states have internal predecessors, (4259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 4259 transitions. [2021-11-03 05:30:45,888 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 4259 transitions. Word has length 32 [2021-11-03 05:30:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:45,888 INFO L470 AbstractCegarLoop]: Abstraction has 1710 states and 4259 transitions. [2021-11-03 05:30:45,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 4259 transitions. [2021-11-03 05:30:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:45,889 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:45,890 INFO L513 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] [2021-11-03 05:30:45,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-11-03 05:30:45,890 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1867557918, now seen corresponding path program 91 times [2021-11-03 05:30:45,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:45,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693510999] [2021-11-03 05:30:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:45,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:45,993 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:45,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693510999] [2021-11-03 05:30:45,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693510999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:45,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:45,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:45,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758380146] [2021-11-03 05:30:45,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:45,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:45,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:45,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:45,995 INFO L87 Difference]: Start difference. First operand 1710 states and 4259 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:46,289 INFO L93 Difference]: Finished difference Result 2384 states and 5622 transitions. [2021-11-03 05:30:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:46,290 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:46,293 INFO L225 Difference]: With dead ends: 2384 [2021-11-03 05:30:46,293 INFO L226 Difference]: Without dead ends: 2298 [2021-11-03 05:30:46,293 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:30:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2021-11-03 05:30:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1626. [2021-11-03 05:30:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 2.4806153846153847) internal successors, (4031), 1625 states have internal predecessors, (4031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 4031 transitions. [2021-11-03 05:30:46,318 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 4031 transitions. Word has length 32 [2021-11-03 05:30:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:46,318 INFO L470 AbstractCegarLoop]: Abstraction has 1626 states and 4031 transitions. [2021-11-03 05:30:46,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 4031 transitions. [2021-11-03 05:30:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:46,321 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:46,321 INFO L513 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] [2021-11-03 05:30:46,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-11-03 05:30:46,322 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash 619911322, now seen corresponding path program 92 times [2021-11-03 05:30:46,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:46,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599945817] [2021-11-03 05:30:46,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:46,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:46,408 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:46,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599945817] [2021-11-03 05:30:46,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599945817] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:46,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:46,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:46,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485396998] [2021-11-03 05:30:46,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:46,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:46,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:46,410 INFO L87 Difference]: Start difference. First operand 1626 states and 4031 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:46,530 INFO L93 Difference]: Finished difference Result 1634 states and 3962 transitions. [2021-11-03 05:30:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:30:46,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:46,533 INFO L225 Difference]: With dead ends: 1634 [2021-11-03 05:30:46,533 INFO L226 Difference]: Without dead ends: 1548 [2021-11-03 05:30:46,533 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2021-11-03 05:30:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2021-11-03 05:30:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1547 states have (on average 2.4499030381383324) internal successors, (3790), 1547 states have internal predecessors, (3790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 3790 transitions. [2021-11-03 05:30:46,561 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 3790 transitions. Word has length 32 [2021-11-03 05:30:46,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:46,562 INFO L470 AbstractCegarLoop]: Abstraction has 1548 states and 3790 transitions. [2021-11-03 05:30:46,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 3790 transitions. [2021-11-03 05:30:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:46,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:46,565 INFO L513 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] [2021-11-03 05:30:46,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-11-03 05:30:46,565 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash 878650914, now seen corresponding path program 93 times [2021-11-03 05:30:46,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:46,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857176441] [2021-11-03 05:30:46,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:46,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:46,646 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:46,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857176441] [2021-11-03 05:30:46,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857176441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:46,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:46,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:46,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365128560] [2021-11-03 05:30:46,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:46,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:46,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:46,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:46,648 INFO L87 Difference]: Start difference. First operand 1548 states and 3790 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:46,737 INFO L93 Difference]: Finished difference Result 1690 states and 4094 transitions. [2021-11-03 05:30:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:30:46,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:46,739 INFO L225 Difference]: With dead ends: 1690 [2021-11-03 05:30:46,739 INFO L226 Difference]: Without dead ends: 1574 [2021-11-03 05:30:46,740 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2021-11-03 05:30:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1566. [2021-11-03 05:30:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 2.450479233226837) internal successors, (3835), 1565 states have internal predecessors, (3835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 3835 transitions. [2021-11-03 05:30:46,758 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 3835 transitions. Word has length 32 [2021-11-03 05:30:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:46,758 INFO L470 AbstractCegarLoop]: Abstraction has 1566 states and 3835 transitions. [2021-11-03 05:30:46,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 3835 transitions. [2021-11-03 05:30:46,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:46,760 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:46,761 INFO L513 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] [2021-11-03 05:30:46,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-11-03 05:30:46,761 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:46,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2002272698, now seen corresponding path program 94 times [2021-11-03 05:30:46,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:46,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682870443] [2021-11-03 05:30:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:46,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:46,872 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:46,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682870443] [2021-11-03 05:30:46,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682870443] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:46,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:46,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:46,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850062623] [2021-11-03 05:30:46,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:46,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:46,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:46,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:46,875 INFO L87 Difference]: Start difference. First operand 1566 states and 3835 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:47,161 INFO L93 Difference]: Finished difference Result 1764 states and 4236 transitions. [2021-11-03 05:30:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:47,162 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:47,165 INFO L225 Difference]: With dead ends: 1764 [2021-11-03 05:30:47,165 INFO L226 Difference]: Without dead ends: 1752 [2021-11-03 05:30:47,165 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:30:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2021-11-03 05:30:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1564. [2021-11-03 05:30:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 2.4491362763915547) internal successors, (3828), 1563 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 3828 transitions. [2021-11-03 05:30:47,197 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 3828 transitions. Word has length 32 [2021-11-03 05:30:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:47,197 INFO L470 AbstractCegarLoop]: Abstraction has 1564 states and 3828 transitions. [2021-11-03 05:30:47,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 3828 transitions. [2021-11-03 05:30:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:47,200 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:47,200 INFO L513 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] [2021-11-03 05:30:47,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-11-03 05:30:47,201 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1178785532, now seen corresponding path program 95 times [2021-11-03 05:30:47,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:47,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222974658] [2021-11-03 05:30:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:47,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:47,351 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:47,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222974658] [2021-11-03 05:30:47,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222974658] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:47,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:47,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:47,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118593183] [2021-11-03 05:30:47,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:47,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:47,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:47,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:47,352 INFO L87 Difference]: Start difference. First operand 1564 states and 3828 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:47,607 INFO L93 Difference]: Finished difference Result 1618 states and 3927 transitions. [2021-11-03 05:30:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 05:30:47,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:47,609 INFO L225 Difference]: With dead ends: 1618 [2021-11-03 05:30:47,609 INFO L226 Difference]: Without dead ends: 1602 [2021-11-03 05:30:47,610 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:30:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2021-11-03 05:30:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1558. [2021-11-03 05:30:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1557 states have (on average 2.448940269749518) internal successors, (3813), 1557 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 3813 transitions. [2021-11-03 05:30:47,640 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 3813 transitions. Word has length 32 [2021-11-03 05:30:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:47,640 INFO L470 AbstractCegarLoop]: Abstraction has 1558 states and 3813 transitions. [2021-11-03 05:30:47,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 3813 transitions. [2021-11-03 05:30:47,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:47,642 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:47,642 INFO L513 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] [2021-11-03 05:30:47,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-11-03 05:30:47,642 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:47,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash 694985576, now seen corresponding path program 96 times [2021-11-03 05:30:47,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:47,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886966072] [2021-11-03 05:30:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:47,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:47,766 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:47,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886966072] [2021-11-03 05:30:47,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886966072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:47,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:47,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:47,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773873877] [2021-11-03 05:30:47,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:47,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:47,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:47,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:47,767 INFO L87 Difference]: Start difference. First operand 1558 states and 3813 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:47,948 INFO L93 Difference]: Finished difference Result 1606 states and 3897 transitions. [2021-11-03 05:30:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:47,950 INFO L225 Difference]: With dead ends: 1606 [2021-11-03 05:30:47,950 INFO L226 Difference]: Without dead ends: 1586 [2021-11-03 05:30:47,950 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:30:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2021-11-03 05:30:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1556. [2021-11-03 05:30:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1555 states have (on average 2.447588424437299) internal successors, (3806), 1555 states have internal predecessors, (3806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 3806 transitions. [2021-11-03 05:30:47,967 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 3806 transitions. Word has length 32 [2021-11-03 05:30:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:47,967 INFO L470 AbstractCegarLoop]: Abstraction has 1556 states and 3806 transitions. [2021-11-03 05:30:47,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 3806 transitions. [2021-11-03 05:30:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:47,969 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:47,969 INFO L513 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] [2021-11-03 05:30:47,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-11-03 05:30:47,969 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:47,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1794780100, now seen corresponding path program 97 times [2021-11-03 05:30:47,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:47,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555055501] [2021-11-03 05:30:47,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:47,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:48,098 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:48,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555055501] [2021-11-03 05:30:48,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555055501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:48,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:48,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:48,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671023590] [2021-11-03 05:30:48,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:48,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:48,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:48,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:48,099 INFO L87 Difference]: Start difference. First operand 1556 states and 3806 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:48,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:48,285 INFO L93 Difference]: Finished difference Result 1648 states and 3978 transitions. [2021-11-03 05:30:48,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:48,285 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:48,287 INFO L225 Difference]: With dead ends: 1648 [2021-11-03 05:30:48,287 INFO L226 Difference]: Without dead ends: 1606 [2021-11-03 05:30:48,287 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:30:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-11-03 05:30:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1552. [2021-11-03 05:30:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 2.4422952933591233) internal successors, (3788), 1551 states have internal predecessors, (3788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 3788 transitions. [2021-11-03 05:30:48,305 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 3788 transitions. Word has length 32 [2021-11-03 05:30:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:48,305 INFO L470 AbstractCegarLoop]: Abstraction has 1552 states and 3788 transitions. [2021-11-03 05:30:48,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 3788 transitions. [2021-11-03 05:30:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:48,306 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:48,306 INFO L513 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] [2021-11-03 05:30:48,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-11-03 05:30:48,307 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash -232636462, now seen corresponding path program 98 times [2021-11-03 05:30:48,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:48,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451201138] [2021-11-03 05:30:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:48,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:48,423 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:48,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451201138] [2021-11-03 05:30:48,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451201138] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:48,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:48,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:48,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664714623] [2021-11-03 05:30:48,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:48,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:48,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:48,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:48,425 INFO L87 Difference]: Start difference. First operand 1552 states and 3788 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:48,654 INFO L93 Difference]: Finished difference Result 1640 states and 3960 transitions. [2021-11-03 05:30:48,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:30:48,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:48,656 INFO L225 Difference]: With dead ends: 1640 [2021-11-03 05:30:48,656 INFO L226 Difference]: Without dead ends: 1610 [2021-11-03 05:30:48,656 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:30:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2021-11-03 05:30:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1548. [2021-11-03 05:30:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1547 states have (on average 2.436974789915966) internal successors, (3770), 1547 states have internal predecessors, (3770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 3770 transitions. [2021-11-03 05:30:48,674 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 3770 transitions. Word has length 32 [2021-11-03 05:30:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:48,674 INFO L470 AbstractCegarLoop]: Abstraction has 1548 states and 3770 transitions. [2021-11-03 05:30:48,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 3770 transitions. [2021-11-03 05:30:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:48,675 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:48,676 INFO L513 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] [2021-11-03 05:30:48,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-11-03 05:30:48,676 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1521437670, now seen corresponding path program 99 times [2021-11-03 05:30:48,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:48,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851639725] [2021-11-03 05:30:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:48,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:48,800 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:48,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851639725] [2021-11-03 05:30:48,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851639725] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:48,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:48,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:48,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662733115] [2021-11-03 05:30:48,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:48,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:48,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:48,802 INFO L87 Difference]: Start difference. First operand 1548 states and 3770 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:48,992 INFO L93 Difference]: Finished difference Result 1732 states and 4152 transitions. [2021-11-03 05:30:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:48,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:48,994 INFO L225 Difference]: With dead ends: 1732 [2021-11-03 05:30:48,994 INFO L226 Difference]: Without dead ends: 1714 [2021-11-03 05:30:48,994 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:30:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2021-11-03 05:30:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1554. [2021-11-03 05:30:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1553 states have (on average 2.433354797166774) internal successors, (3779), 1553 states have internal predecessors, (3779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 3779 transitions. [2021-11-03 05:30:49,014 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 3779 transitions. Word has length 32 [2021-11-03 05:30:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:49,015 INFO L470 AbstractCegarLoop]: Abstraction has 1554 states and 3779 transitions. [2021-11-03 05:30:49,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 3779 transitions. [2021-11-03 05:30:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:49,018 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:49,018 INFO L513 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] [2021-11-03 05:30:49,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-11-03 05:30:49,018 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:49,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:49,019 INFO L85 PathProgramCache]: Analyzing trace with hash -740076146, now seen corresponding path program 100 times [2021-11-03 05:30:49,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:49,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898436108] [2021-11-03 05:30:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:49,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:49,140 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:49,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898436108] [2021-11-03 05:30:49,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898436108] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:49,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:49,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:49,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149511228] [2021-11-03 05:30:49,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:49,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:49,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:49,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:49,141 INFO L87 Difference]: Start difference. First operand 1554 states and 3779 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:49,390 INFO L93 Difference]: Finished difference Result 2548 states and 6007 transitions. [2021-11-03 05:30:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:30:49,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:49,393 INFO L225 Difference]: With dead ends: 2548 [2021-11-03 05:30:49,393 INFO L226 Difference]: Without dead ends: 2496 [2021-11-03 05:30:49,394 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:30:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2021-11-03 05:30:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1514. [2021-11-03 05:30:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 2.447455386649042) internal successors, (3703), 1513 states have internal predecessors, (3703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 3703 transitions. [2021-11-03 05:30:49,416 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 3703 transitions. Word has length 32 [2021-11-03 05:30:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:49,416 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 3703 transitions. [2021-11-03 05:30:49,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 3703 transitions. [2021-11-03 05:30:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:49,419 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:49,419 INFO L513 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] [2021-11-03 05:30:49,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-11-03 05:30:49,419 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash -502928010, now seen corresponding path program 101 times [2021-11-03 05:30:49,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:49,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772182619] [2021-11-03 05:30:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:49,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:49,543 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:49,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772182619] [2021-11-03 05:30:49,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772182619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:49,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:49,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:49,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977933007] [2021-11-03 05:30:49,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:49,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:49,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:49,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:49,545 INFO L87 Difference]: Start difference. First operand 1514 states and 3703 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:49,806 INFO L93 Difference]: Finished difference Result 1572 states and 3808 transitions. [2021-11-03 05:30:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 05:30:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:49,808 INFO L225 Difference]: With dead ends: 1572 [2021-11-03 05:30:49,808 INFO L226 Difference]: Without dead ends: 1560 [2021-11-03 05:30:49,809 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:30:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2021-11-03 05:30:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1514. [2021-11-03 05:30:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 2.4448116325181757) internal successors, (3699), 1513 states have internal predecessors, (3699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 3699 transitions. [2021-11-03 05:30:49,825 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 3699 transitions. Word has length 32 [2021-11-03 05:30:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:49,826 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 3699 transitions. [2021-11-03 05:30:49,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 3699 transitions. [2021-11-03 05:30:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:49,827 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:49,827 INFO L513 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] [2021-11-03 05:30:49,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-11-03 05:30:49,828 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash -617232466, now seen corresponding path program 102 times [2021-11-03 05:30:49,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:49,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491853657] [2021-11-03 05:30:49,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:49,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:49,943 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:49,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491853657] [2021-11-03 05:30:49,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491853657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:49,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:49,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:49,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525103841] [2021-11-03 05:30:49,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:49,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:49,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:49,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:49,945 INFO L87 Difference]: Start difference. First operand 1514 states and 3699 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:50,222 INFO L93 Difference]: Finished difference Result 2446 states and 5761 transitions. [2021-11-03 05:30:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 05:30:50,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:50,227 INFO L225 Difference]: With dead ends: 2446 [2021-11-03 05:30:50,227 INFO L226 Difference]: Without dead ends: 2434 [2021-11-03 05:30:50,227 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:30:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2021-11-03 05:30:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 1526. [2021-11-03 05:30:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 2.438032786885246) internal successors, (3718), 1525 states have internal predecessors, (3718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 3718 transitions. [2021-11-03 05:30:50,260 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 3718 transitions. Word has length 32 [2021-11-03 05:30:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:50,260 INFO L470 AbstractCegarLoop]: Abstraction has 1526 states and 3718 transitions. [2021-11-03 05:30:50,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 3718 transitions. [2021-11-03 05:30:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:50,263 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:50,263 INFO L513 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] [2021-11-03 05:30:50,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-11-03 05:30:50,264 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1415780176, now seen corresponding path program 103 times [2021-11-03 05:30:50,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:50,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20712540] [2021-11-03 05:30:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:50,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:50,394 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:50,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20712540] [2021-11-03 05:30:50,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20712540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:50,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:50,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:50,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961552000] [2021-11-03 05:30:50,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:50,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:50,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:50,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:50,396 INFO L87 Difference]: Start difference. First operand 1526 states and 3718 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:50,703 INFO L93 Difference]: Finished difference Result 1680 states and 4024 transitions. [2021-11-03 05:30:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:50,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:50,705 INFO L225 Difference]: With dead ends: 1680 [2021-11-03 05:30:50,705 INFO L226 Difference]: Without dead ends: 1656 [2021-11-03 05:30:50,705 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:30:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2021-11-03 05:30:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1498. [2021-11-03 05:30:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1497 states have (on average 2.4442217768871077) internal successors, (3659), 1497 states have internal predecessors, (3659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 3659 transitions. [2021-11-03 05:30:50,723 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 3659 transitions. Word has length 32 [2021-11-03 05:30:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:50,723 INFO L470 AbstractCegarLoop]: Abstraction has 1498 states and 3659 transitions. [2021-11-03 05:30:50,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 3659 transitions. [2021-11-03 05:30:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:50,725 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:50,725 INFO L513 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] [2021-11-03 05:30:50,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-11-03 05:30:50,725 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash 875945146, now seen corresponding path program 104 times [2021-11-03 05:30:50,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:50,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339953872] [2021-11-03 05:30:50,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:50,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:50,860 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:50,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339953872] [2021-11-03 05:30:50,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339953872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:50,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:50,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:50,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613901533] [2021-11-03 05:30:50,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:50,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:50,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:50,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:50,862 INFO L87 Difference]: Start difference. First operand 1498 states and 3659 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:51,112 INFO L93 Difference]: Finished difference Result 1532 states and 3720 transitions. [2021-11-03 05:30:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:51,112 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:51,115 INFO L225 Difference]: With dead ends: 1532 [2021-11-03 05:30:51,115 INFO L226 Difference]: Without dead ends: 1496 [2021-11-03 05:30:51,115 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:30:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2021-11-03 05:30:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1470. [2021-11-03 05:30:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1469 states have (on average 2.456092579986385) internal successors, (3608), 1469 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 3608 transitions. [2021-11-03 05:30:51,141 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 3608 transitions. Word has length 32 [2021-11-03 05:30:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:51,141 INFO L470 AbstractCegarLoop]: Abstraction has 1470 states and 3608 transitions. [2021-11-03 05:30:51,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 3608 transitions. [2021-11-03 05:30:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:51,144 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:51,144 INFO L513 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] [2021-11-03 05:30:51,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-11-03 05:30:51,144 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:51,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:51,145 INFO L85 PathProgramCache]: Analyzing trace with hash 520579796, now seen corresponding path program 105 times [2021-11-03 05:30:51,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:51,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317988655] [2021-11-03 05:30:51,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:51,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:51,237 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:51,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317988655] [2021-11-03 05:30:51,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317988655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:51,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:51,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:30:51,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391717353] [2021-11-03 05:30:51,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:30:51,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:51,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:30:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:30:51,239 INFO L87 Difference]: Start difference. First operand 1470 states and 3608 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:51,366 INFO L93 Difference]: Finished difference Result 2214 states and 5060 transitions. [2021-11-03 05:30:51,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:30:51,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:51,368 INFO L225 Difference]: With dead ends: 2214 [2021-11-03 05:30:51,368 INFO L226 Difference]: Without dead ends: 1880 [2021-11-03 05:30:51,368 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2021-11-03 05:30:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1386. [2021-11-03 05:30:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1385 states have (on average 2.3935018050541514) internal successors, (3315), 1385 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 3315 transitions. [2021-11-03 05:30:51,424 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 3315 transitions. Word has length 32 [2021-11-03 05:30:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:51,425 INFO L470 AbstractCegarLoop]: Abstraction has 1386 states and 3315 transitions. [2021-11-03 05:30:51,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 3315 transitions. [2021-11-03 05:30:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:51,427 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:51,427 INFO L513 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] [2021-11-03 05:30:51,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-11-03 05:30:51,428 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:51,428 INFO L85 PathProgramCache]: Analyzing trace with hash -208608290, now seen corresponding path program 106 times [2021-11-03 05:30:51,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:51,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515889493] [2021-11-03 05:30:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:51,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:51,516 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:51,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515889493] [2021-11-03 05:30:51,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515889493] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:51,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:51,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:30:51,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117693222] [2021-11-03 05:30:51,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:30:51,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:30:51,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:30:51,518 INFO L87 Difference]: Start difference. First operand 1386 states and 3315 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:51,743 INFO L93 Difference]: Finished difference Result 1596 states and 3329 transitions. [2021-11-03 05:30:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:51,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:51,745 INFO L225 Difference]: With dead ends: 1596 [2021-11-03 05:30:51,745 INFO L226 Difference]: Without dead ends: 986 [2021-11-03 05:30:51,745 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:51,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2021-11-03 05:30:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 778. [2021-11-03 05:30:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.18018018018018) internal successors, (1694), 777 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1694 transitions. [2021-11-03 05:30:51,759 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1694 transitions. Word has length 32 [2021-11-03 05:30:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:51,759 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1694 transitions. [2021-11-03 05:30:51,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1694 transitions. [2021-11-03 05:30:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:51,761 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:51,761 INFO L513 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] [2021-11-03 05:30:51,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-11-03 05:30:51,761 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:51,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1806951424, now seen corresponding path program 107 times [2021-11-03 05:30:51,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:51,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867484691] [2021-11-03 05:30:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:51,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:51,865 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:51,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867484691] [2021-11-03 05:30:51,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867484691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:51,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:51,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:51,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328054860] [2021-11-03 05:30:51,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:51,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:51,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:51,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:51,867 INFO L87 Difference]: Start difference. First operand 778 states and 1694 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:52,146 INFO L93 Difference]: Finished difference Result 860 states and 1725 transitions. [2021-11-03 05:30:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:52,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:52,147 INFO L225 Difference]: With dead ends: 860 [2021-11-03 05:30:52,147 INFO L226 Difference]: Without dead ends: 438 [2021-11-03 05:30:52,147 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:30:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-11-03 05:30:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 372. [2021-11-03 05:30:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 2.059299191374663) internal successors, (764), 371 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 764 transitions. [2021-11-03 05:30:52,151 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 764 transitions. Word has length 32 [2021-11-03 05:30:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:52,151 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 764 transitions. [2021-11-03 05:30:52,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 764 transitions. [2021-11-03 05:30:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:52,152 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:52,152 INFO L513 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] [2021-11-03 05:30:52,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-11-03 05:30:52,152 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:52,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:52,152 INFO L85 PathProgramCache]: Analyzing trace with hash -135722132, now seen corresponding path program 108 times [2021-11-03 05:30:52,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:52,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064045478] [2021-11-03 05:30:52,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:52,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:52,284 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:52,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064045478] [2021-11-03 05:30:52,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064045478] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:52,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:52,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:52,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221597176] [2021-11-03 05:30:52,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:52,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:52,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:52,286 INFO L87 Difference]: Start difference. First operand 372 states and 764 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:52,388 INFO L93 Difference]: Finished difference Result 384 states and 780 transitions. [2021-11-03 05:30:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:52,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:52,389 INFO L225 Difference]: With dead ends: 384 [2021-11-03 05:30:52,389 INFO L226 Difference]: Without dead ends: 368 [2021-11-03 05:30:52,389 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-11-03 05:30:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2021-11-03 05:30:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 2.0544959128065394) internal successors, (754), 367 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 754 transitions. [2021-11-03 05:30:52,393 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 754 transitions. Word has length 32 [2021-11-03 05:30:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:52,394 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 754 transitions. [2021-11-03 05:30:52,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 754 transitions. [2021-11-03 05:30:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:52,394 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:52,394 INFO L513 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] [2021-11-03 05:30:52,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-11-03 05:30:52,394 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:52,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1078533364, now seen corresponding path program 109 times [2021-11-03 05:30:52,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:52,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467515887] [2021-11-03 05:30:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:52,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:52,515 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:52,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467515887] [2021-11-03 05:30:52,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467515887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:52,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:52,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:52,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84834797] [2021-11-03 05:30:52,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:52,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:52,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:52,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:52,517 INFO L87 Difference]: Start difference. First operand 368 states and 754 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:52,636 INFO L93 Difference]: Finished difference Result 376 states and 764 transitions. [2021-11-03 05:30:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:52,637 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:52,637 INFO L225 Difference]: With dead ends: 376 [2021-11-03 05:30:52,638 INFO L226 Difference]: Without dead ends: 364 [2021-11-03 05:30:52,638 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-03 05:30:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2021-11-03 05:30:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 2.049586776859504) internal successors, (744), 363 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 744 transitions. [2021-11-03 05:30:52,643 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 744 transitions. Word has length 32 [2021-11-03 05:30:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:52,643 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 744 transitions. [2021-11-03 05:30:52,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 744 transitions. [2021-11-03 05:30:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:52,644 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:52,644 INFO L513 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] [2021-11-03 05:30:52,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-11-03 05:30:52,644 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash -780135098, now seen corresponding path program 110 times [2021-11-03 05:30:52,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:52,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674708569] [2021-11-03 05:30:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:52,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:52,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:52,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674708569] [2021-11-03 05:30:52,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674708569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:52,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:52,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:52,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080453684] [2021-11-03 05:30:52,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:52,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:52,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:52,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:52,773 INFO L87 Difference]: Start difference. First operand 364 states and 744 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:52,902 INFO L93 Difference]: Finished difference Result 376 states and 764 transitions. [2021-11-03 05:30:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:52,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:52,903 INFO L225 Difference]: With dead ends: 376 [2021-11-03 05:30:52,903 INFO L226 Difference]: Without dead ends: 368 [2021-11-03 05:30:52,904 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-11-03 05:30:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2021-11-03 05:30:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 2.043596730245232) internal successors, (750), 367 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 750 transitions. [2021-11-03 05:30:52,910 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 750 transitions. Word has length 32 [2021-11-03 05:30:52,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:52,910 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 750 transitions. [2021-11-03 05:30:52,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 750 transitions. [2021-11-03 05:30:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:52,911 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:52,911 INFO L513 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] [2021-11-03 05:30:52,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-11-03 05:30:52,911 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:52,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:52,912 INFO L85 PathProgramCache]: Analyzing trace with hash 944326700, now seen corresponding path program 111 times [2021-11-03 05:30:52,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:52,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349827584] [2021-11-03 05:30:52,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:52,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:53,033 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:53,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349827584] [2021-11-03 05:30:53,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349827584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:53,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:53,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:53,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951267268] [2021-11-03 05:30:53,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:53,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:53,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:53,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:53,035 INFO L87 Difference]: Start difference. First operand 368 states and 750 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:53,194 INFO L93 Difference]: Finished difference Result 450 states and 873 transitions. [2021-11-03 05:30:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:53,195 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:53,195 INFO L225 Difference]: With dead ends: 450 [2021-11-03 05:30:53,195 INFO L226 Difference]: Without dead ends: 410 [2021-11-03 05:30:53,196 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-03 05:30:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 336. [2021-11-03 05:30:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.0686567164179106) internal successors, (693), 335 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 693 transitions. [2021-11-03 05:30:53,199 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 693 transitions. Word has length 32 [2021-11-03 05:30:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:53,199 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 693 transitions. [2021-11-03 05:30:53,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 693 transitions. [2021-11-03 05:30:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:53,200 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:53,200 INFO L513 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] [2021-11-03 05:30:53,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-11-03 05:30:53,200 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:53,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1772227938, now seen corresponding path program 112 times [2021-11-03 05:30:53,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:53,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259634527] [2021-11-03 05:30:53,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:53,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:53,313 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:53,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259634527] [2021-11-03 05:30:53,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259634527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:53,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:53,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:53,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158062390] [2021-11-03 05:30:53,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:53,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:53,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:53,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:53,315 INFO L87 Difference]: Start difference. First operand 336 states and 693 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:53,535 INFO L93 Difference]: Finished difference Result 388 states and 777 transitions. [2021-11-03 05:30:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:53,535 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:53,536 INFO L225 Difference]: With dead ends: 388 [2021-11-03 05:30:53,536 INFO L226 Difference]: Without dead ends: 376 [2021-11-03 05:30:53,536 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:30:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-11-03 05:30:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 332. [2021-11-03 05:30:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.0634441087613293) internal successors, (683), 331 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 683 transitions. [2021-11-03 05:30:53,540 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 683 transitions. Word has length 32 [2021-11-03 05:30:53,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:53,540 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 683 transitions. [2021-11-03 05:30:53,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 683 transitions. [2021-11-03 05:30:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:53,540 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:53,540 INFO L513 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] [2021-11-03 05:30:53,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-11-03 05:30:53,540 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash -948740772, now seen corresponding path program 113 times [2021-11-03 05:30:53,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:53,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088358616] [2021-11-03 05:30:53,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:53,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:53,663 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:53,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088358616] [2021-11-03 05:30:53,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088358616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:53,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:53,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:53,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597747575] [2021-11-03 05:30:53,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:53,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:53,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:53,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:53,665 INFO L87 Difference]: Start difference. First operand 332 states and 683 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:53,838 INFO L93 Difference]: Finished difference Result 344 states and 699 transitions. [2021-11-03 05:30:53,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 05:30:53,839 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:53,839 INFO L225 Difference]: With dead ends: 344 [2021-11-03 05:30:53,839 INFO L226 Difference]: Without dead ends: 328 [2021-11-03 05:30:53,839 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:30:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-11-03 05:30:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2021-11-03 05:30:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.058103975535168) internal successors, (673), 327 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 673 transitions. [2021-11-03 05:30:53,843 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 673 transitions. Word has length 32 [2021-11-03 05:30:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:53,843 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 673 transitions. [2021-11-03 05:30:53,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 673 transitions. [2021-11-03 05:30:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:53,843 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:53,843 INFO L513 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] [2021-11-03 05:30:53,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-11-03 05:30:53,844 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:53,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1910322432, now seen corresponding path program 114 times [2021-11-03 05:30:53,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:53,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699598932] [2021-11-03 05:30:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:53,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:53,950 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:53,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699598932] [2021-11-03 05:30:53,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699598932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:53,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:53,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:53,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015766937] [2021-11-03 05:30:53,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:53,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:53,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:53,952 INFO L87 Difference]: Start difference. First operand 328 states and 673 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:54,134 INFO L93 Difference]: Finished difference Result 344 states and 695 transitions. [2021-11-03 05:30:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:54,134 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:54,135 INFO L225 Difference]: With dead ends: 344 [2021-11-03 05:30:54,135 INFO L226 Difference]: Without dead ends: 324 [2021-11-03 05:30:54,135 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:30:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-03 05:30:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2021-11-03 05:30:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.0526315789473686) internal successors, (663), 323 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 663 transitions. [2021-11-03 05:30:54,139 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 663 transitions. Word has length 32 [2021-11-03 05:30:54,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:54,139 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 663 transitions. [2021-11-03 05:30:54,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 663 transitions. [2021-11-03 05:30:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:54,140 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:54,140 INFO L513 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] [2021-11-03 05:30:54,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-11-03 05:30:54,140 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash -810527908, now seen corresponding path program 115 times [2021-11-03 05:30:54,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:54,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754340742] [2021-11-03 05:30:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:54,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:54,277 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:54,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754340742] [2021-11-03 05:30:54,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754340742] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:54,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:54,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:54,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885013979] [2021-11-03 05:30:54,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:54,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:54,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:54,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:54,278 INFO L87 Difference]: Start difference. First operand 324 states and 663 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:54,392 INFO L93 Difference]: Finished difference Result 382 states and 748 transitions. [2021-11-03 05:30:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:54,392 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:54,393 INFO L225 Difference]: With dead ends: 382 [2021-11-03 05:30:54,393 INFO L226 Difference]: Without dead ends: 340 [2021-11-03 05:30:54,393 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-03 05:30:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 320. [2021-11-03 05:30:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.0219435736677114) internal successors, (645), 319 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 645 transitions. [2021-11-03 05:30:54,396 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 645 transitions. Word has length 32 [2021-11-03 05:30:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:54,396 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 645 transitions. [2021-11-03 05:30:54,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 645 transitions. [2021-11-03 05:30:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:54,397 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:54,397 INFO L513 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] [2021-11-03 05:30:54,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-11-03 05:30:54,397 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:54,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1541380144, now seen corresponding path program 116 times [2021-11-03 05:30:54,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:54,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194667830] [2021-11-03 05:30:54,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:54,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:54,531 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:54,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194667830] [2021-11-03 05:30:54,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194667830] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:54,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:54,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:54,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037763095] [2021-11-03 05:30:54,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:54,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:54,533 INFO L87 Difference]: Start difference. First operand 320 states and 645 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:54,702 INFO L93 Difference]: Finished difference Result 358 states and 700 transitions. [2021-11-03 05:30:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:54,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:54,704 INFO L225 Difference]: With dead ends: 358 [2021-11-03 05:30:54,704 INFO L226 Difference]: Without dead ends: 328 [2021-11-03 05:30:54,704 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-11-03 05:30:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 316. [2021-11-03 05:30:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.9904761904761905) internal successors, (627), 315 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 627 transitions. [2021-11-03 05:30:54,709 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 627 transitions. Word has length 32 [2021-11-03 05:30:54,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:54,709 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 627 transitions. [2021-11-03 05:30:54,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 627 transitions. [2021-11-03 05:30:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:54,710 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:54,710 INFO L513 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] [2021-11-03 05:30:54,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-11-03 05:30:54,711 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:54,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:54,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1464785944, now seen corresponding path program 117 times [2021-11-03 05:30:54,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:54,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504342093] [2021-11-03 05:30:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:54,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:54,831 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:54,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504342093] [2021-11-03 05:30:54,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504342093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:54,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:54,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:54,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732982257] [2021-11-03 05:30:54,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:54,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:54,832 INFO L87 Difference]: Start difference. First operand 316 states and 627 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:55,001 INFO L93 Difference]: Finished difference Result 358 states and 692 transitions. [2021-11-03 05:30:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:55,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:55,002 INFO L225 Difference]: With dead ends: 358 [2021-11-03 05:30:55,002 INFO L226 Difference]: Without dead ends: 340 [2021-11-03 05:30:55,003 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:30:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-03 05:30:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 316. [2021-11-03 05:30:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.965079365079365) internal successors, (619), 315 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 619 transitions. [2021-11-03 05:30:55,006 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 619 transitions. Word has length 32 [2021-11-03 05:30:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:55,006 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 619 transitions. [2021-11-03 05:30:55,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 619 transitions. [2021-11-03 05:30:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:55,006 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:55,006 INFO L513 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] [2021-11-03 05:30:55,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-11-03 05:30:55,007 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:55,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash 501783462, now seen corresponding path program 118 times [2021-11-03 05:30:55,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:55,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781512892] [2021-11-03 05:30:55,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:55,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:55,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:55,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781512892] [2021-11-03 05:30:55,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781512892] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:55,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:55,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:55,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034861060] [2021-11-03 05:30:55,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:55,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:55,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:55,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:55,129 INFO L87 Difference]: Start difference. First operand 316 states and 619 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:55,288 INFO L93 Difference]: Finished difference Result 412 states and 765 transitions. [2021-11-03 05:30:55,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:55,288 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:55,289 INFO L225 Difference]: With dead ends: 412 [2021-11-03 05:30:55,289 INFO L226 Difference]: Without dead ends: 360 [2021-11-03 05:30:55,289 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-03 05:30:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 270. [2021-11-03 05:30:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 2.0) internal successors, (538), 269 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 538 transitions. [2021-11-03 05:30:55,292 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 538 transitions. Word has length 32 [2021-11-03 05:30:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:55,292 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 538 transitions. [2021-11-03 05:30:55,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 538 transitions. [2021-11-03 05:30:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:55,293 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:55,293 INFO L513 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] [2021-11-03 05:30:55,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-11-03 05:30:55,293 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:55,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:55,293 INFO L85 PathProgramCache]: Analyzing trace with hash -991959122, now seen corresponding path program 119 times [2021-11-03 05:30:55,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:55,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974498883] [2021-11-03 05:30:55,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:55,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:55,421 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:55,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974498883] [2021-11-03 05:30:55,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974498883] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:55,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:55,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:55,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522877487] [2021-11-03 05:30:55,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:55,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:55,423 INFO L87 Difference]: Start difference. First operand 270 states and 538 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:55,569 INFO L93 Difference]: Finished difference Result 282 states and 554 transitions. [2021-11-03 05:30:55,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:30:55,570 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:55,570 INFO L225 Difference]: With dead ends: 282 [2021-11-03 05:30:55,570 INFO L226 Difference]: Without dead ends: 266 [2021-11-03 05:30:55,570 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:30:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-03 05:30:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-11-03 05:30:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.9924528301886792) internal successors, (528), 265 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 528 transitions. [2021-11-03 05:30:55,573 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 528 transitions. Word has length 32 [2021-11-03 05:30:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:55,573 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 528 transitions. [2021-11-03 05:30:55,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 528 transitions. [2021-11-03 05:30:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:55,574 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:55,574 INFO L513 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] [2021-11-03 05:30:55,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-11-03 05:30:55,574 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:55,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:55,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1884816588, now seen corresponding path program 120 times [2021-11-03 05:30:55,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:55,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876916995] [2021-11-03 05:30:55,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:55,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:55,698 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:55,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876916995] [2021-11-03 05:30:55,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876916995] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:55,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:55,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:55,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687689069] [2021-11-03 05:30:55,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:55,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:55,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:55,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:55,700 INFO L87 Difference]: Start difference. First operand 266 states and 528 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:55,913 INFO L93 Difference]: Finished difference Result 274 states and 538 transitions. [2021-11-03 05:30:55,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:55,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:55,914 INFO L225 Difference]: With dead ends: 274 [2021-11-03 05:30:55,914 INFO L226 Difference]: Without dead ends: 262 [2021-11-03 05:30:55,914 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:30:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-03 05:30:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-11-03 05:30:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.9846743295019158) internal successors, (518), 261 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 518 transitions. [2021-11-03 05:30:55,934 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 518 transitions. Word has length 32 [2021-11-03 05:30:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:55,935 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 518 transitions. [2021-11-03 05:30:55,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 518 transitions. [2021-11-03 05:30:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:55,935 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:55,936 INFO L513 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] [2021-11-03 05:30:55,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-11-03 05:30:55,936 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1819934552, now seen corresponding path program 121 times [2021-11-03 05:30:55,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:55,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361003615] [2021-11-03 05:30:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:55,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:56,046 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:56,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361003615] [2021-11-03 05:30:56,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361003615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:56,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:56,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:56,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812244775] [2021-11-03 05:30:56,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:56,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:56,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:56,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:56,048 INFO L87 Difference]: Start difference. First operand 262 states and 518 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:56,194 INFO L93 Difference]: Finished difference Result 338 states and 638 transitions. [2021-11-03 05:30:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 05:30:56,194 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:56,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:56,195 INFO L225 Difference]: With dead ends: 338 [2021-11-03 05:30:56,195 INFO L226 Difference]: Without dead ends: 330 [2021-11-03 05:30:56,195 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:30:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-03 05:30:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2021-11-03 05:30:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.973384030418251) internal successors, (519), 263 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 519 transitions. [2021-11-03 05:30:56,198 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 519 transitions. Word has length 32 [2021-11-03 05:30:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:56,198 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 519 transitions. [2021-11-03 05:30:56,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 519 transitions. [2021-11-03 05:30:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:56,199 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:56,199 INFO L513 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] [2021-11-03 05:30:56,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-11-03 05:30:56,199 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1931917782, now seen corresponding path program 122 times [2021-11-03 05:30:56,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:56,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601757822] [2021-11-03 05:30:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:56,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:56,321 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:56,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601757822] [2021-11-03 05:30:56,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601757822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:56,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:56,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:56,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759250176] [2021-11-03 05:30:56,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:56,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:56,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:56,323 INFO L87 Difference]: Start difference. First operand 264 states and 519 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:56,521 INFO L93 Difference]: Finished difference Result 282 states and 546 transitions. [2021-11-03 05:30:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:56,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:56,522 INFO L225 Difference]: With dead ends: 282 [2021-11-03 05:30:56,522 INFO L226 Difference]: Without dead ends: 256 [2021-11-03 05:30:56,522 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:30:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-03 05:30:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2021-11-03 05:30:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.9958847736625513) internal successors, (485), 243 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 485 transitions. [2021-11-03 05:30:56,525 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 485 transitions. Word has length 32 [2021-11-03 05:30:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:56,525 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 485 transitions. [2021-11-03 05:30:56,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 485 transitions. [2021-11-03 05:30:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:56,526 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:56,526 INFO L513 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] [2021-11-03 05:30:56,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-11-03 05:30:56,526 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:56,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:56,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1524233540, now seen corresponding path program 123 times [2021-11-03 05:30:56,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:56,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805717697] [2021-11-03 05:30:56,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:56,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:56,651 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:56,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805717697] [2021-11-03 05:30:56,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805717697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:56,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:56,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:56,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313826847] [2021-11-03 05:30:56,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:56,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:56,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:56,653 INFO L87 Difference]: Start difference. First operand 244 states and 485 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:56,743 INFO L93 Difference]: Finished difference Result 256 states and 501 transitions. [2021-11-03 05:30:56,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:56,744 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:56,744 INFO L225 Difference]: With dead ends: 256 [2021-11-03 05:30:56,744 INFO L226 Difference]: Without dead ends: 240 [2021-11-03 05:30:56,744 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-03 05:30:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-11-03 05:30:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.9874476987447698) internal successors, (475), 239 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 475 transitions. [2021-11-03 05:30:56,747 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 475 transitions. Word has length 32 [2021-11-03 05:30:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:56,747 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 475 transitions. [2021-11-03 05:30:56,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 475 transitions. [2021-11-03 05:30:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:56,747 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:56,747 INFO L513 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] [2021-11-03 05:30:56,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-11-03 05:30:56,748 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash -259913934, now seen corresponding path program 124 times [2021-11-03 05:30:56,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:56,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754150313] [2021-11-03 05:30:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:56,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:56,863 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:56,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754150313] [2021-11-03 05:30:56,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754150313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:56,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:56,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:56,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842737071] [2021-11-03 05:30:56,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:56,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:56,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:56,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:56,865 INFO L87 Difference]: Start difference. First operand 240 states and 475 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:56,969 INFO L93 Difference]: Finished difference Result 248 states and 485 transitions. [2021-11-03 05:30:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:56,970 INFO L225 Difference]: With dead ends: 248 [2021-11-03 05:30:56,970 INFO L226 Difference]: Without dead ends: 236 [2021-11-03 05:30:56,971 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:30:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-03 05:30:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-11-03 05:30:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.9787234042553192) internal successors, (465), 235 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 465 transitions. [2021-11-03 05:30:56,974 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 465 transitions. Word has length 32 [2021-11-03 05:30:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:56,974 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 465 transitions. [2021-11-03 05:30:56,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 465 transitions. [2021-11-03 05:30:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:56,975 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:56,975 INFO L513 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] [2021-11-03 05:30:56,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-11-03 05:30:56,975 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:56,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash -359291734, now seen corresponding path program 125 times [2021-11-03 05:30:56,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:56,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375111407] [2021-11-03 05:30:56,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:56,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:57,099 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:57,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375111407] [2021-11-03 05:30:57,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375111407] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:57,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:57,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:57,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462184112] [2021-11-03 05:30:57,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:57,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:57,103 INFO L87 Difference]: Start difference. First operand 236 states and 465 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:57,209 INFO L93 Difference]: Finished difference Result 244 states and 477 transitions. [2021-11-03 05:30:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:30:57,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:57,210 INFO L225 Difference]: With dead ends: 244 [2021-11-03 05:30:57,210 INFO L226 Difference]: Without dead ends: 236 [2021-11-03 05:30:57,210 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-03 05:30:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-11-03 05:30:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.9702127659574469) internal successors, (463), 235 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 463 transitions. [2021-11-03 05:30:57,214 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 463 transitions. Word has length 32 [2021-11-03 05:30:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:57,214 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 463 transitions. [2021-11-03 05:30:57,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 463 transitions. [2021-11-03 05:30:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:57,215 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:57,215 INFO L513 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] [2021-11-03 05:30:57,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-11-03 05:30:57,215 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1365170064, now seen corresponding path program 126 times [2021-11-03 05:30:57,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:57,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132809946] [2021-11-03 05:30:57,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:57,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:57,344 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:57,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132809946] [2021-11-03 05:30:57,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132809946] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:57,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:57,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:57,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336303104] [2021-11-03 05:30:57,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:57,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:57,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:57,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:57,348 INFO L87 Difference]: Start difference. First operand 236 states and 463 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:57,503 INFO L93 Difference]: Finished difference Result 288 states and 541 transitions. [2021-11-03 05:30:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:57,503 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:57,504 INFO L225 Difference]: With dead ends: 288 [2021-11-03 05:30:57,504 INFO L226 Difference]: Without dead ends: 258 [2021-11-03 05:30:57,504 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-03 05:30:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 214. [2021-11-03 05:30:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.0) internal successors, (426), 213 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 426 transitions. [2021-11-03 05:30:57,506 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 426 transitions. Word has length 32 [2021-11-03 05:30:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:57,506 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 426 transitions. [2021-11-03 05:30:57,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 426 transitions. [2021-11-03 05:30:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:57,507 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:57,507 INFO L513 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] [2021-11-03 05:30:57,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-11-03 05:30:57,507 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1779639636, now seen corresponding path program 127 times [2021-11-03 05:30:57,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:57,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291337013] [2021-11-03 05:30:57,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:57,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:57,612 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:57,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291337013] [2021-11-03 05:30:57,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291337013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:57,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:57,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:57,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994025052] [2021-11-03 05:30:57,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:57,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:57,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:57,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:57,613 INFO L87 Difference]: Start difference. First operand 214 states and 426 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:57,779 INFO L93 Difference]: Finished difference Result 230 states and 448 transitions. [2021-11-03 05:30:57,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 05:30:57,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:57,780 INFO L225 Difference]: With dead ends: 230 [2021-11-03 05:30:57,780 INFO L226 Difference]: Without dead ends: 218 [2021-11-03 05:30:57,780 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:30:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-03 05:30:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2021-11-03 05:30:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.9812206572769953) internal successors, (422), 213 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 422 transitions. [2021-11-03 05:30:57,784 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 422 transitions. Word has length 32 [2021-11-03 05:30:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:57,784 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 422 transitions. [2021-11-03 05:30:57,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 422 transitions. [2021-11-03 05:30:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:57,785 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:57,785 INFO L513 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] [2021-11-03 05:30:57,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-11-03 05:30:57,786 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash -616521682, now seen corresponding path program 128 times [2021-11-03 05:30:57,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:57,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003065087] [2021-11-03 05:30:57,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:57,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:57,898 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:57,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003065087] [2021-11-03 05:30:57,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003065087] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:57,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:57,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:57,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004663050] [2021-11-03 05:30:57,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:57,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:57,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:57,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:57,908 INFO L87 Difference]: Start difference. First operand 214 states and 422 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:58,058 INFO L93 Difference]: Finished difference Result 248 states and 471 transitions. [2021-11-03 05:30:58,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 05:30:58,058 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:58,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:58,059 INFO L225 Difference]: With dead ends: 248 [2021-11-03 05:30:58,059 INFO L226 Difference]: Without dead ends: 236 [2021-11-03 05:30:58,059 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:30:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-03 05:30:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 206. [2021-11-03 05:30:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.951219512195122) internal successors, (400), 205 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 400 transitions. [2021-11-03 05:30:58,062 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 400 transitions. Word has length 32 [2021-11-03 05:30:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:58,062 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 400 transitions. [2021-11-03 05:30:58,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 400 transitions. [2021-11-03 05:30:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:58,063 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:58,063 INFO L513 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] [2021-11-03 05:30:58,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-11-03 05:30:58,064 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:58,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash -596619474, now seen corresponding path program 129 times [2021-11-03 05:30:58,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:58,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871793212] [2021-11-03 05:30:58,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:58,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:58,165 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:58,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871793212] [2021-11-03 05:30:58,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871793212] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:58,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:58,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:58,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282378997] [2021-11-03 05:30:58,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:58,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:58,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:58,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:58,167 INFO L87 Difference]: Start difference. First operand 206 states and 400 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:58,335 INFO L93 Difference]: Finished difference Result 238 states and 446 transitions. [2021-11-03 05:30:58,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:58,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:58,335 INFO L225 Difference]: With dead ends: 238 [2021-11-03 05:30:58,336 INFO L226 Difference]: Without dead ends: 214 [2021-11-03 05:30:58,336 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:30:58,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-11-03 05:30:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 190. [2021-11-03 05:30:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.947089947089947) internal successors, (368), 189 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 368 transitions. [2021-11-03 05:30:58,338 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 368 transitions. Word has length 32 [2021-11-03 05:30:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:58,338 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 368 transitions. [2021-11-03 05:30:58,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 368 transitions. [2021-11-03 05:30:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:58,339 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:58,339 INFO L513 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] [2021-11-03 05:30:58,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-11-03 05:30:58,339 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:58,339 INFO L85 PathProgramCache]: Analyzing trace with hash 727389370, now seen corresponding path program 130 times [2021-11-03 05:30:58,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:58,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25575160] [2021-11-03 05:30:58,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:58,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:58,459 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:58,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25575160] [2021-11-03 05:30:58,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25575160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:58,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:58,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:58,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775298868] [2021-11-03 05:30:58,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:58,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:58,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:58,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:58,460 INFO L87 Difference]: Start difference. First operand 190 states and 368 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:58,617 INFO L93 Difference]: Finished difference Result 206 states and 390 transitions. [2021-11-03 05:30:58,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:30:58,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:58,618 INFO L225 Difference]: With dead ends: 206 [2021-11-03 05:30:58,618 INFO L226 Difference]: Without dead ends: 182 [2021-11-03 05:30:58,618 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:30:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-03 05:30:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-11-03 05:30:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.9337016574585635) internal successors, (350), 181 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 350 transitions. [2021-11-03 05:30:58,620 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 350 transitions. Word has length 32 [2021-11-03 05:30:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:58,620 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 350 transitions. [2021-11-03 05:30:58,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 350 transitions. [2021-11-03 05:30:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:58,621 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:58,621 INFO L513 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] [2021-11-03 05:30:58,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-11-03 05:30:58,621 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:58,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2097380264, now seen corresponding path program 131 times [2021-11-03 05:30:58,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:58,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866109898] [2021-11-03 05:30:58,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:58,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:58,732 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:58,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866109898] [2021-11-03 05:30:58,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866109898] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:58,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:58,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:58,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355164903] [2021-11-03 05:30:58,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:58,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:58,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:58,733 INFO L87 Difference]: Start difference. First operand 182 states and 350 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:58,862 INFO L93 Difference]: Finished difference Result 236 states and 425 transitions. [2021-11-03 05:30:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:58,862 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:58,862 INFO L225 Difference]: With dead ends: 236 [2021-11-03 05:30:58,863 INFO L226 Difference]: Without dead ends: 194 [2021-11-03 05:30:58,863 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-03 05:30:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 178. [2021-11-03 05:30:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.8757062146892656) internal successors, (332), 177 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 332 transitions. [2021-11-03 05:30:58,866 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 332 transitions. Word has length 32 [2021-11-03 05:30:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:58,866 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 332 transitions. [2021-11-03 05:30:58,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 332 transitions. [2021-11-03 05:30:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:58,866 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:58,867 INFO L513 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] [2021-11-03 05:30:58,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-11-03 05:30:58,867 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:58,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1793880172, now seen corresponding path program 132 times [2021-11-03 05:30:58,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:58,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822009805] [2021-11-03 05:30:58,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:58,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:58,991 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:58,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822009805] [2021-11-03 05:30:58,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822009805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:58,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:58,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:58,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699608139] [2021-11-03 05:30:58,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:58,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:58,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:58,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:58,992 INFO L87 Difference]: Start difference. First operand 178 states and 332 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:59,110 INFO L93 Difference]: Finished difference Result 212 states and 377 transitions. [2021-11-03 05:30:59,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:59,110 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:59,111 INFO L225 Difference]: With dead ends: 212 [2021-11-03 05:30:59,111 INFO L226 Difference]: Without dead ends: 182 [2021-11-03 05:30:59,111 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:30:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-03 05:30:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2021-11-03 05:30:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.8150289017341041) internal successors, (314), 173 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 314 transitions. [2021-11-03 05:30:59,113 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 314 transitions. Word has length 32 [2021-11-03 05:30:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:59,113 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 314 transitions. [2021-11-03 05:30:59,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 314 transitions. [2021-11-03 05:30:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:59,113 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:59,113 INFO L513 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] [2021-11-03 05:30:59,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-11-03 05:30:59,114 INFO L402 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:59,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1212285916, now seen corresponding path program 133 times [2021-11-03 05:30:59,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:59,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697750596] [2021-11-03 05:30:59,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:59,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:59,223 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:59,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697750596] [2021-11-03 05:30:59,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697750596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:59,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:59,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:59,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700479742] [2021-11-03 05:30:59,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:59,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:59,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:59,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:59,225 INFO L87 Difference]: Start difference. First operand 174 states and 314 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:59,359 INFO L93 Difference]: Finished difference Result 204 states and 353 transitions. [2021-11-03 05:30:59,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:30:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:59,360 INFO L225 Difference]: With dead ends: 204 [2021-11-03 05:30:59,360 INFO L226 Difference]: Without dead ends: 186 [2021-11-03 05:30:59,360 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:30:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-11-03 05:30:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2021-11-03 05:30:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.7514792899408285) internal successors, (296), 169 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 296 transitions. [2021-11-03 05:30:59,362 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 296 transitions. Word has length 32 [2021-11-03 05:30:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:59,362 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 296 transitions. [2021-11-03 05:30:59,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 296 transitions. [2021-11-03 05:30:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:59,362 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:59,363 INFO L513 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] [2021-11-03 05:30:59,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-11-03 05:30:59,363 INFO L402 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:59,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:59,363 INFO L85 PathProgramCache]: Analyzing trace with hash 249283434, now seen corresponding path program 134 times [2021-11-03 05:30:59,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:59,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272897161] [2021-11-03 05:30:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:59,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:59,483 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:59,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272897161] [2021-11-03 05:30:59,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272897161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:59,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:59,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:59,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900902492] [2021-11-03 05:30:59,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:59,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:59,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:59,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:59,485 INFO L87 Difference]: Start difference. First operand 170 states and 296 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:59,591 INFO L93 Difference]: Finished difference Result 190 states and 320 transitions. [2021-11-03 05:30:59,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:30:59,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:59,591 INFO L225 Difference]: With dead ends: 190 [2021-11-03 05:30:59,591 INFO L226 Difference]: Without dead ends: 134 [2021-11-03 05:30:59,591 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:30:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-03 05:30:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2021-11-03 05:30:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.7478260869565216) internal successors, (201), 115 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 201 transitions. [2021-11-03 05:30:59,593 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 201 transitions. Word has length 32 [2021-11-03 05:30:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:59,594 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 201 transitions. [2021-11-03 05:30:59,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 201 transitions. [2021-11-03 05:30:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:59,594 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:59,594 INFO L513 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] [2021-11-03 05:30:59,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-11-03 05:30:59,595 INFO L402 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1840195592, now seen corresponding path program 135 times [2021-11-03 05:30:59,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:59,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466138825] [2021-11-03 05:30:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:59,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:59,698 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:59,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466138825] [2021-11-03 05:30:59,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466138825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:30:59,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:30:59,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:30:59,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576370564] [2021-11-03 05:30:59,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:30:59,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:30:59,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:30:59,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:30:59,699 INFO L87 Difference]: Start difference. First operand 116 states and 201 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:30:59,879 INFO L93 Difference]: Finished difference Result 132 states and 223 transitions. [2021-11-03 05:30:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 05:30:59,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:30:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:30:59,880 INFO L225 Difference]: With dead ends: 132 [2021-11-03 05:30:59,880 INFO L226 Difference]: Without dead ends: 120 [2021-11-03 05:30:59,880 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:30:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-03 05:30:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2021-11-03 05:30:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 115 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 197 transitions. [2021-11-03 05:30:59,881 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 197 transitions. Word has length 32 [2021-11-03 05:30:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:30:59,881 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 197 transitions. [2021-11-03 05:30:59,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:30:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 197 transitions. [2021-11-03 05:30:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:30:59,882 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:30:59,882 INFO L513 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] [2021-11-03 05:30:59,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-11-03 05:30:59,882 INFO L402 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:30:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:30:59,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1887296786, now seen corresponding path program 136 times [2021-11-03 05:30:59,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:30:59,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728680591] [2021-11-03 05:30:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:30:59,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:30:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:30:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:30:59,999 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:30:59,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728680591] [2021-11-03 05:30:59,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728680591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:31:00,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:31:00,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:31:00,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450357525] [2021-11-03 05:31:00,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:31:00,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:31:00,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:31:00,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:31:00,001 INFO L87 Difference]: Start difference. First operand 116 states and 197 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:31:00,144 INFO L93 Difference]: Finished difference Result 132 states and 219 transitions. [2021-11-03 05:31:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:31:00,144 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:31:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:31:00,144 INFO L225 Difference]: With dead ends: 132 [2021-11-03 05:31:00,144 INFO L226 Difference]: Without dead ends: 124 [2021-11-03 05:31:00,144 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:31:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-03 05:31:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2021-11-03 05:31:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.6782608695652175) internal successors, (193), 115 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 193 transitions. [2021-11-03 05:31:00,146 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 193 transitions. Word has length 32 [2021-11-03 05:31:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:31:00,146 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 193 transitions. [2021-11-03 05:31:00,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 193 transitions. [2021-11-03 05:31:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:31:00,146 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:31:00,147 INFO L513 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] [2021-11-03 05:31:00,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-11-03 05:31:00,147 INFO L402 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:31:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:31:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1982160884, now seen corresponding path program 137 times [2021-11-03 05:31:00,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:31:00,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74662153] [2021-11-03 05:31:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:31:00,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:31:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:31:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:31:00,255 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:31:00,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74662153] [2021-11-03 05:31:00,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74662153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:31:00,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:31:00,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:31:00,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448029882] [2021-11-03 05:31:00,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:31:00,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:31:00,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:31:00,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:31:00,257 INFO L87 Difference]: Start difference. First operand 116 states and 193 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:31:00,381 INFO L93 Difference]: Finished difference Result 130 states and 212 transitions. [2021-11-03 05:31:00,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:31:00,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:31:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:31:00,382 INFO L225 Difference]: With dead ends: 130 [2021-11-03 05:31:00,382 INFO L226 Difference]: Without dead ends: 114 [2021-11-03 05:31:00,382 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:31:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-03 05:31:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2021-11-03 05:31:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6407766990291262) internal successors, (169), 103 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2021-11-03 05:31:00,384 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 32 [2021-11-03 05:31:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:31:00,384 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2021-11-03 05:31:00,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2021-11-03 05:31:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:31:00,384 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:31:00,384 INFO L513 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] [2021-11-03 05:31:00,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-11-03 05:31:00,384 INFO L402 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:31:00,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:31:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2081897222, now seen corresponding path program 138 times [2021-11-03 05:31:00,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:31:00,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384377508] [2021-11-03 05:31:00,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:31:00,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:31:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:31:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:31:00,517 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:31:00,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384377508] [2021-11-03 05:31:00,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384377508] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:31:00,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:31:00,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:31:00,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226486995] [2021-11-03 05:31:00,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:31:00,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:31:00,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:31:00,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:31:00,518 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:31:00,668 INFO L93 Difference]: Finished difference Result 104 states and 167 transitions. [2021-11-03 05:31:00,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:31:00,668 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:31:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:31:00,669 INFO L225 Difference]: With dead ends: 104 [2021-11-03 05:31:00,669 INFO L226 Difference]: Without dead ends: 76 [2021-11-03 05:31:00,669 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-03 05:31:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-03 05:31:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-11-03 05:31:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 75 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2021-11-03 05:31:00,670 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 122 transitions. Word has length 32 [2021-11-03 05:31:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:31:00,670 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 122 transitions. [2021-11-03 05:31:00,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 122 transitions. [2021-11-03 05:31:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:31:00,670 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:31:00,670 INFO L513 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] [2021-11-03 05:31:00,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-11-03 05:31:00,671 INFO L402 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:31:00,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:31:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash -713537496, now seen corresponding path program 139 times [2021-11-03 05:31:00,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:31:00,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149610628] [2021-11-03 05:31:00,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:31:00,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:31:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:31:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:31:00,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:31:00,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149610628] [2021-11-03 05:31:00,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149610628] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:31:00,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:31:00,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:31:00,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414532646] [2021-11-03 05:31:00,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:31:00,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:31:00,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:31:00,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:31:00,791 INFO L87 Difference]: Start difference. First operand 76 states and 122 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:31:00,868 INFO L93 Difference]: Finished difference Result 88 states and 138 transitions. [2021-11-03 05:31:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:31:00,869 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:31:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:31:00,869 INFO L225 Difference]: With dead ends: 88 [2021-11-03 05:31:00,869 INFO L226 Difference]: Without dead ends: 72 [2021-11-03 05:31:00,869 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:31:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-03 05:31:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-03 05:31:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 112 transitions. [2021-11-03 05:31:00,870 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 112 transitions. Word has length 32 [2021-11-03 05:31:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:31:00,870 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 112 transitions. [2021-11-03 05:31:00,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 112 transitions. [2021-11-03 05:31:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:31:00,871 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:31:00,871 INFO L513 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] [2021-11-03 05:31:00,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-11-03 05:31:00,871 INFO L402 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:31:00,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:31:00,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1363125874, now seen corresponding path program 140 times [2021-11-03 05:31:00,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:31:00,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024203917] [2021-11-03 05:31:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:31:00,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:31:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:31:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:31:00,957 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:31:00,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024203917] [2021-11-03 05:31:00,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024203917] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:31:00,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:31:00,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:31:00,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818668559] [2021-11-03 05:31:00,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:31:00,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:31:00,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:31:00,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:31:00,958 INFO L87 Difference]: Start difference. First operand 72 states and 112 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:31:01,019 INFO L93 Difference]: Finished difference Result 80 states and 122 transitions. [2021-11-03 05:31:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:31:01,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:31:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:31:01,019 INFO L225 Difference]: With dead ends: 80 [2021-11-03 05:31:01,019 INFO L226 Difference]: Without dead ends: 68 [2021-11-03 05:31:01,020 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:31:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-03 05:31:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-03 05:31:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 67 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2021-11-03 05:31:01,021 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 32 [2021-11-03 05:31:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:31:01,022 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2021-11-03 05:31:01,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2021-11-03 05:31:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:31:01,022 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:31:01,022 INFO L513 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] [2021-11-03 05:31:01,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-11-03 05:31:01,022 INFO L402 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:31:01,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:31:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1462503674, now seen corresponding path program 141 times [2021-11-03 05:31:01,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:31:01,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403074632] [2021-11-03 05:31:01,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:31:01,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:31:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:31:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:31:01,139 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:31:01,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403074632] [2021-11-03 05:31:01,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403074632] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:31:01,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:31:01,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:31:01,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079894053] [2021-11-03 05:31:01,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:31:01,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:31:01,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:31:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:31:01,141 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:31:01,236 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2021-11-03 05:31:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:31:01,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:31:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:31:01,237 INFO L225 Difference]: With dead ends: 72 [2021-11-03 05:31:01,237 INFO L226 Difference]: Without dead ends: 64 [2021-11-03 05:31:01,237 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:31:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-03 05:31:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-03 05:31:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 63 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2021-11-03 05:31:01,238 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 32 [2021-11-03 05:31:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:31:01,238 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2021-11-03 05:31:01,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2021-11-03 05:31:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-03 05:31:01,239 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:31:01,239 INFO L513 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] [2021-11-03 05:31:01,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-11-03 05:31:01,239 INFO L402 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 2 more)] === [2021-11-03 05:31:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:31:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash -275534732, now seen corresponding path program 142 times [2021-11-03 05:31:01,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:31:01,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091882775] [2021-11-03 05:31:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:31:01,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:31:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:31:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:31:01,376 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:31:01,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091882775] [2021-11-03 05:31:01,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091882775] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:31:01,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:31:01,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-03 05:31:01,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104314532] [2021-11-03 05:31:01,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-03 05:31:01,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:31:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-03 05:31:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:31:01,377 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:31:01,440 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2021-11-03 05:31:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:31:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-03 05:31:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:31:01,441 INFO L225 Difference]: With dead ends: 50 [2021-11-03 05:31:01,441 INFO L226 Difference]: Without dead ends: 0 [2021-11-03 05:31:01,441 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:31:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-03 05:31:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-03 05:31:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-03 05:31:01,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2021-11-03 05:31:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:31:01,442 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-03 05:31:01,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:31:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-03 05:31:01,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-03 05:31:01,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:31:01,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-03 05:31:01,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-03 05:31:01,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-11-03 05:31:01,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATION [2021-11-03 05:31:01,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATION [2021-11-03 05:31:01,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-11-03 05:31:01,448 INFO L731 BasicCegarLoop]: Path program histogram: [142] [2021-11-03 05:31:01,450 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-03 05:31:01,450 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 05:31:01,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 05:31:01 BasicIcfg [2021-11-03 05:31:01,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 05:31:01,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 05:31:01,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 05:31:01,453 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 05:31:01,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:29:54" (3/4) ... [2021-11-03 05:31:01,456 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-03 05:31:01,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-11-03 05:31:01,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-11-03 05:31:01,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-11-03 05:31:01,463 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2021-11-03 05:31:01,463 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2021-11-03 05:31:01,469 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-11-03 05:31:01,469 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-03 05:31:01,469 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-03 05:31:01,470 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-03 05:31:01,509 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 05:31:01,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 05:31:01,511 INFO L168 Benchmark]: Toolchain (without parser) took 67620.10 ms. Allocated memory was 102.8 MB in the beginning and 966.8 MB in the end (delta: 864.0 MB). Free memory was 69.6 MB in the beginning and 726.7 MB in the end (delta: -657.0 MB). Peak memory consumption was 206.4 MB. Max. memory is 16.1 GB. [2021-11-03 05:31:01,511 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 102.8 MB. Free memory is still 57.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:31:01,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.86 ms. Allocated memory is still 102.8 MB. Free memory was 69.6 MB in the beginning and 74.4 MB in the end (delta: -4.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 05:31:01,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.14 ms. Allocated memory is still 102.8 MB. Free memory was 74.4 MB in the beginning and 72.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:31:01,512 INFO L168 Benchmark]: Boogie Preprocessor took 32.55 ms. Allocated memory is still 102.8 MB. Free memory was 72.3 MB in the beginning and 70.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:31:01,513 INFO L168 Benchmark]: RCFGBuilder took 713.08 ms. Allocated memory is still 102.8 MB. Free memory was 70.7 MB in the beginning and 48.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:31:01,513 INFO L168 Benchmark]: TraceAbstraction took 66450.70 ms. Allocated memory was 102.8 MB in the beginning and 966.8 MB in the end (delta: 864.0 MB). Free memory was 48.0 MB in the beginning and 729.8 MB in the end (delta: -681.9 MB). Peak memory consumption was 184.3 MB. Max. memory is 16.1 GB. [2021-11-03 05:31:01,514 INFO L168 Benchmark]: Witness Printer took 56.89 ms. Allocated memory is still 966.8 MB. Free memory was 729.8 MB in the beginning and 726.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:31:01,516 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 102.8 MB. Free memory is still 57.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 310.86 ms. Allocated memory is still 102.8 MB. Free memory was 69.6 MB in the beginning and 74.4 MB in the end (delta: -4.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.14 ms. Allocated memory is still 102.8 MB. Free memory was 74.4 MB in the beginning and 72.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.55 ms. Allocated memory is still 102.8 MB. Free memory was 72.3 MB in the beginning and 70.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 713.08 ms. Allocated memory is still 102.8 MB. Free memory was 70.7 MB in the beginning and 48.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 66450.70 ms. Allocated memory was 102.8 MB in the beginning and 966.8 MB in the end (delta: 864.0 MB). Free memory was 48.0 MB in the beginning and 729.8 MB in the end (delta: -681.9 MB). Peak memory consumption was 184.3 MB. Max. memory is 16.1 GB. * Witness Printer took 56.89 ms. Allocated memory is still 966.8 MB. Free memory was 729.8 MB in the beginning and 726.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 171 PlacesBefore, 54 PlacesAfterwards, 157 TransitionsBefore, 38 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 7 FixpointIterations, 79 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 2 ChoiceCompositions, 125 TotalNumberOfCompositions, 5154 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2959, positive: 2825, positive conditional: 0, positive unconditional: 2825, negative: 134, negative conditional: 0, negative unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1478, positive: 1433, positive conditional: 0, positive unconditional: 1433, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1478, positive: 1381, positive conditional: 0, positive unconditional: 1381, negative: 97, negative conditional: 0, negative unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 248, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 141, negative conditional: 0, negative unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2959, positive: 1392, positive conditional: 0, positive unconditional: 1392, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 1478, unknown conditional: 0, unknown unconditional: 1478] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 145, Positive conditional cache size: 0, Positive unconditional cache size: 145, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 168]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 197 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 66.2s, OverallIterations: 142, TraceHistogramMax: 1, PathProgramHistogramMax: 142, EmptinessCheckTime: 0.6s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6789 SDtfs, 6487 SDslu, 27167 SDs, 0 SdLazy, 29130 SolverSat, 5214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1883 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1710 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3458 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=36, InterpolantAutomatonStates: 1802, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 142 MinimizatonAttempts, 57862 StatesRemovedByMinimization, 118 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 4544 NumberOfCodeBlocks, 4544 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 4402 ConstructedInterpolants, 0 QuantifiedInterpolants, 20844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 142 InterpolantComputations, 142 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-11-03 05:31:01,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25e3eea-40f3-457f-996f-4830949eaabe/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE