./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI --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 785828885bdc7a6e840f746d82abc399ce755172 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:28:57,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:28:57,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:28:58,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:28:58,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:28:58,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:28:58,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:28:58,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:28:58,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:28:58,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:28:58,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:28:58,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:28:58,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:28:58,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:28:58,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:28:58,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:28:58,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:28:58,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:28:58,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:28:58,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:28:58,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:28:58,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:28:58,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:28:58,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:28:58,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:28:58,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:28:58,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:28:58,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:28:58,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:28:58,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:28:58,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:28:58,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:28:58,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:28:58,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:28:58,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:28:58,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:28:58,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:28:58,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:28:58,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:28:58,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:28:58,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:28:58,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:28:58,088 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:28:58,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:28:58,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:28:58,090 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:28:58,090 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:28:58,091 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:28:58,091 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:28:58,091 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:28:58,092 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:28:58,092 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:28:58,093 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:28:58,093 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:28:58,094 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:28:58,094 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:28:58,094 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:28:58,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:28:58,096 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:28:58,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:28:58,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:28:58,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:28:58,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:28:58,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:28:58,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:28:58,098 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:28:58,099 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:28:58,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:28:58,100 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:28:58,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:28:58,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:28:58,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:28:58,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:28:58,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:28:58,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:28:58,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:28:58,102 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:28:58,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:28:58,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:28:58,103 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:28:58,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:28:58,103 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_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/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_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI 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 -> 785828885bdc7a6e840f746d82abc399ce755172 [2021-10-11 02:28:58,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:28:58,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:28:58,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:28:58,414 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:28:58,415 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:28:58,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt.i [2021-10-11 02:28:58,493 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/data/b913f9687/88e020ef56f34c77a632d20b01390676/FLAG6cfe501cd [2021-10-11 02:28:59,128 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:28:59,142 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/sv-benchmarks/c/pthread-wmm/rfi000_power.opt.i [2021-10-11 02:28:59,165 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/data/b913f9687/88e020ef56f34c77a632d20b01390676/FLAG6cfe501cd [2021-10-11 02:28:59,507 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/data/b913f9687/88e020ef56f34c77a632d20b01390676 [2021-10-11 02:28:59,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:28:59,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:28:59,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:28:59,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:28:59,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:28:59,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:28:59" (1/1) ... [2021-10-11 02:28:59,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44451ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:59, skipping insertion in model container [2021-10-11 02:28:59,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:28:59" (1/1) ... [2021-10-11 02:28:59,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:28:59,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:28:59,802 WARN L226 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_f72770a0-8cef-4829-b367-eb0c9889d13d/sv-benchmarks/c/pthread-wmm/rfi000_power.opt.i[950,963] [2021-10-11 02:29:00,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:29:00,038 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:29:00,055 WARN L226 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_f72770a0-8cef-4829-b367-eb0c9889d13d/sv-benchmarks/c/pthread-wmm/rfi000_power.opt.i[950,963] [2021-10-11 02:29:00,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:29:00,210 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:29:00,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00 WrapperNode [2021-10-11 02:29:00,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:29:00,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:29:00,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:29:00,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:29:00,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (1/1) ... [2021-10-11 02:29:00,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (1/1) ... [2021-10-11 02:29:00,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:29:00,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:29:00,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:29:00,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:29:00,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (1/1) ... [2021-10-11 02:29:00,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (1/1) ... [2021-10-11 02:29:00,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (1/1) ... [2021-10-11 02:29:00,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (1/1) ... [2021-10-11 02:29:00,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (1/1) ... [2021-10-11 02:29:00,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (1/1) ... [2021-10-11 02:29:00,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (1/1) ... [2021-10-11 02:29:00,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:29:00,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:29:00,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:29:00,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:29:00,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:29:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 02:29:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 02:29:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:29:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:29:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 02:29:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 02:29:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 02:29:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 02:29:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:29:00,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 02:29:00,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:29:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:29:00,485 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 02:29:02,619 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:29:02,619 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 02:29:02,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:29:02 BoogieIcfgContainer [2021-10-11 02:29:02,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:29:02,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:29:02,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:29:02,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:29:02,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:28:59" (1/3) ... [2021-10-11 02:29:02,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7962b6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:29:02, skipping insertion in model container [2021-10-11 02:29:02,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:00" (2/3) ... [2021-10-11 02:29:02,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7962b6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:29:02, skipping insertion in model container [2021-10-11 02:29:02,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:29:02" (3/3) ... [2021-10-11 02:29:02,633 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2021-10-11 02:29:02,648 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 02:29:02,648 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:29:02,652 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 02:29:02,653 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 02:29:02,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,694 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,694 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,695 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,695 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,703 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,703 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,705 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,705 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,706 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,706 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,714 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,715 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,715 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:29:02,723 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 02:29:02,738 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-11 02:29:02,772 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:29:02,772 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:29:02,772 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:29:02,772 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:29:02,773 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:29:02,773 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:29:02,773 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:29:02,774 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:29:02,790 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 02:29:02,791 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 83 transitions, 176 flow [2021-10-11 02:29:02,795 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 83 transitions, 176 flow [2021-10-11 02:29:02,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow [2021-10-11 02:29:02,865 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-10-11 02:29:02,865 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 02:29:02,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-10-11 02:29:02,877 INFO L116 LiptonReduction]: Number of co-enabled transitions 1046 [2021-10-11 02:29:03,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:03,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:03,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:03,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:03,313 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:29:03,314 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:03,318 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:29:03,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:04,356 WARN L197 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-10-11 02:29:04,763 WARN L197 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-10-11 02:29:06,608 WARN L197 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2021-10-11 02:29:07,368 WARN L197 SmtUtils]: Spent 757.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-10-11 02:29:07,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:07,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:07,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,491 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:07,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:07,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:07,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:07,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:07,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:07,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:07,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,793 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:07,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:07,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:07,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:07,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:07,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:07,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:07,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:07,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:29:07,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:07,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:29:07,964 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:07,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:29:07,969 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:29:07,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:29:07,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:07,978 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:29:07,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:08,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:08,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:08,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:08,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:08,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:08,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:08,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:08,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:08,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:08,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:08,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:29:08,323 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:29:08,325 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:29:08,328 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:29:08,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:29:08,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:29:08,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:08,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:08,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-10-11 02:29:08,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:08,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-10-11 02:29:08,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:08,794 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:08,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,829 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:29:08,834 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:29:08,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:08,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:29:08,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:29:08,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,850 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:29:08,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2021-10-11 02:29:08,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:08,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:08,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:08,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:08,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:08,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:08,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,305 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:29:09,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:09,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:09,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:09,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:09,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,347 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:09,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:09,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:09,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:09,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:09,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:09,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,540 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:09,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:09,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:09,548 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:09,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:09,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:09,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:09,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:09,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:09,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:09,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:09,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:09,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,624 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:09,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,766 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:09,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:09,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:09,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,789 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:09,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:09,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,822 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:09,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:09,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:09,856 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:09,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:10,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,033 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:10,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,086 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,088 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,176 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:10,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:10,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:10,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:10,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:10,228 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:10,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,251 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:10,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:10,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:10,604 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:10,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:10,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:10,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:10,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:10,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-10-11 02:29:10,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:29:10,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:10,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:10,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,807 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:10,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,837 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:10,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,867 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:10,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,928 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,929 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:10,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,964 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:10,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:10,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:10,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:10,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:11,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:29:11,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:11,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:11,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:11,290 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-10-11 02:29:11,855 WARN L197 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2021-10-11 02:29:12,056 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-10-11 02:29:12,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,463 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,481 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:12,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:12,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,564 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,692 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,776 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,779 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:12,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:12,798 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,802 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,804 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:12,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:29:12,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-10-11 02:29:12,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-10-11 02:29:12,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:12,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:12,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:12,886 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:12,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:13,411 WARN L197 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-10-11 02:29:13,883 WARN L197 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-10-11 02:29:14,664 WARN L197 SmtUtils]: Spent 778.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-10-11 02:29:15,519 WARN L197 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-10-11 02:29:16,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:29:16,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:16,062 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:29:16,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:16,086 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:16,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:16,087 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:16,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:16,512 WARN L197 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-10-11 02:29:16,925 WARN L197 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-10-11 02:29:17,770 WARN L197 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-10-11 02:29:18,542 WARN L197 SmtUtils]: Spent 771.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-10-11 02:29:18,591 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:18,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:18,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:18,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:18,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:18,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:18,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:18,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:18,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:18,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:18,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:18,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:18,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,657 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:18,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:18,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:29:18,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:29:18,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:18,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:18,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,762 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-10-11 02:29:18,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:18,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-10-11 02:29:18,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:18,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:18,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:18,801 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:18,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:19,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:19,204 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:19,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:19,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:19,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,256 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:19,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:19,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,295 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:19,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,338 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:19,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:19,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,388 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:29:19,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,389 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:29:19,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:19,911 WARN L197 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-10-11 02:29:20,307 WARN L197 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2021-10-11 02:29:21,292 WARN L197 SmtUtils]: Spent 983.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-10-11 02:29:22,209 WARN L197 SmtUtils]: Spent 915.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-10-11 02:29:22,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:22,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-10-11 02:29:22,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:22,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:22,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,308 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,311 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,315 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:22,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:22,387 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:22,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,428 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:22,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,516 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:22,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:22,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:22,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,688 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:22,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:22,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:22,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,729 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:22,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,735 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,739 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,741 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,742 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,744 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:22,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,798 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:29:22,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:22,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:22,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:22,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,822 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,858 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,943 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:22,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:22,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:22,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,019 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:23,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,020 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:23,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:29:23,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:23,075 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:23,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:23,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:23,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,129 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:23,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:23,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:23,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:23,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:23,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,184 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,186 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,192 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,194 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:23,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:23,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,265 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:23,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:23,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:23,336 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,337 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,340 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,347 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,403 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:23,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,404 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:23,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:23,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:23,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:23,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-10-11 02:29:23,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:23,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-10-11 02:29:23,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:23,481 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:23,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:23,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:23,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:23,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:23,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:23,533 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:23,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:23,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:23,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:29:23,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:23,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:23,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:23,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:23,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:23,705 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:23,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,125 WARN L197 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-10-11 02:29:24,264 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-10-11 02:29:24,584 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-10-11 02:29:24,732 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-10-11 02:29:24,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:24,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:24,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:24,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:24,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,823 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:24,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:24,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:24,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,848 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:24,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:24,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:24,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:24,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:24,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:24,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:24,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:24,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-10-11 02:29:24,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:25,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-10-11 02:29:25,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:25,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:29:25,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:25,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:25,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:25,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:25,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,060 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:25,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:25,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,065 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:25,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,067 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2021-10-11 02:29:25,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:25,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,120 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:25,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,122 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:25,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:29:25,124 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2021-10-11 02:29:25,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,165 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:25,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:25,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:25,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:25,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,244 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-10-11 02:29:25,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-10-11 02:29:25,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:29:25,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:29:25,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:25,276 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:29:25,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:29:25,297 INFO L131 LiptonReduction]: Checked pairs total: 2978 [2021-10-11 02:29:25,297 INFO L133 LiptonReduction]: Total number of compositions: 74 [2021-10-11 02:29:25,303 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2021-10-11 02:29:25,331 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 212 states. [2021-10-11 02:29:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2021-10-11 02:29:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-11 02:29:25,338 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:25,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-11 02:29:25,339 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:25,346 INFO L82 PathProgramCache]: Analyzing trace with hash 889089914, now seen corresponding path program 1 times [2021-10-11 02:29:25,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:25,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594399308] [2021-10-11 02:29:25,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:25,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594399308] [2021-10-11 02:29:25,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:25,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 02:29:25,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586114211] [2021-10-11 02:29:25,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:29:25,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:25,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:29:25,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:29:25,665 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 3 states. [2021-10-11 02:29:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:25,751 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2021-10-11 02:29:25,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:29:25,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-10-11 02:29:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:25,784 INFO L225 Difference]: With dead ends: 187 [2021-10-11 02:29:25,790 INFO L226 Difference]: Without dead ends: 152 [2021-10-11 02:29:25,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:29:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-10-11 02:29:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-10-11 02:29:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-10-11 02:29:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 357 transitions. [2021-10-11 02:29:25,907 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 357 transitions. Word has length 5 [2021-10-11 02:29:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:25,908 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 357 transitions. [2021-10-11 02:29:25,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:29:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 357 transitions. [2021-10-11 02:29:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-11 02:29:25,912 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:25,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:25,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:29:25,912 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash -283028353, now seen corresponding path program 1 times [2021-10-11 02:29:25,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:25,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133218806] [2021-10-11 02:29:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:26,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133218806] [2021-10-11 02:29:26,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:26,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:29:26,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856333080] [2021-10-11 02:29:26,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:29:26,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:29:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:29:26,098 INFO L87 Difference]: Start difference. First operand 152 states and 357 transitions. Second operand 4 states. [2021-10-11 02:29:26,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:26,169 INFO L93 Difference]: Finished difference Result 225 states and 501 transitions. [2021-10-11 02:29:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:29:26,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2021-10-11 02:29:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:26,173 INFO L225 Difference]: With dead ends: 225 [2021-10-11 02:29:26,173 INFO L226 Difference]: Without dead ends: 165 [2021-10-11 02:29:26,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:29:26,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-10-11 02:29:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 145. [2021-10-11 02:29:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2021-10-11 02:29:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 325 transitions. [2021-10-11 02:29:26,187 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 325 transitions. Word has length 7 [2021-10-11 02:29:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:26,188 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 325 transitions. [2021-10-11 02:29:26,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:29:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 325 transitions. [2021-10-11 02:29:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:29:26,189 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:26,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:26,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:29:26,189 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash -940331430, now seen corresponding path program 1 times [2021-10-11 02:29:26,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:26,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837550626] [2021-10-11 02:29:26,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:26,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837550626] [2021-10-11 02:29:26,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:26,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 02:29:26,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618573436] [2021-10-11 02:29:26,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:29:26,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:26,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:29:26,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:29:26,266 INFO L87 Difference]: Start difference. First operand 145 states and 325 transitions. Second operand 3 states. [2021-10-11 02:29:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:26,275 INFO L93 Difference]: Finished difference Result 133 states and 292 transitions. [2021-10-11 02:29:26,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:29:26,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-10-11 02:29:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:26,278 INFO L225 Difference]: With dead ends: 133 [2021-10-11 02:29:26,278 INFO L226 Difference]: Without dead ends: 101 [2021-10-11 02:29:26,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:29:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-10-11 02:29:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-10-11 02:29:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-10-11 02:29:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 224 transitions. [2021-10-11 02:29:26,286 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 224 transitions. Word has length 8 [2021-10-11 02:29:26,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:26,286 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 224 transitions. [2021-10-11 02:29:26,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:29:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 224 transitions. [2021-10-11 02:29:26,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:29:26,287 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:26,288 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:26,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:29:26,288 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:26,288 INFO L82 PathProgramCache]: Analyzing trace with hash 489676200, now seen corresponding path program 1 times [2021-10-11 02:29:26,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:26,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497812881] [2021-10-11 02:29:26,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:26,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497812881] [2021-10-11 02:29:26,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:26,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:29:26,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118317359] [2021-10-11 02:29:26,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:29:26,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:29:26,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:29:26,384 INFO L87 Difference]: Start difference. First operand 101 states and 224 transitions. Second operand 4 states. [2021-10-11 02:29:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:26,422 INFO L93 Difference]: Finished difference Result 149 states and 328 transitions. [2021-10-11 02:29:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:29:26,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-10-11 02:29:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:26,424 INFO L225 Difference]: With dead ends: 149 [2021-10-11 02:29:26,424 INFO L226 Difference]: Without dead ends: 89 [2021-10-11 02:29:26,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:29:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-10-11 02:29:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-10-11 02:29:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-10-11 02:29:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 192 transitions. [2021-10-11 02:29:26,434 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 192 transitions. Word has length 11 [2021-10-11 02:29:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:26,434 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 192 transitions. [2021-10-11 02:29:26,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:29:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 192 transitions. [2021-10-11 02:29:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:29:26,436 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:26,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:26,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:29:26,436 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash 489648300, now seen corresponding path program 2 times [2021-10-11 02:29:26,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:26,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886061656] [2021-10-11 02:29:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:26,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886061656] [2021-10-11 02:29:26,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:26,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 02:29:26,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234662284] [2021-10-11 02:29:26,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:29:26,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:26,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:29:26,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:29:26,572 INFO L87 Difference]: Start difference. First operand 89 states and 192 transitions. Second operand 3 states. [2021-10-11 02:29:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:26,581 INFO L93 Difference]: Finished difference Result 85 states and 181 transitions. [2021-10-11 02:29:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:29:26,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-10-11 02:29:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:26,583 INFO L225 Difference]: With dead ends: 85 [2021-10-11 02:29:26,584 INFO L226 Difference]: Without dead ends: 85 [2021-10-11 02:29:26,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:29:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-10-11 02:29:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-10-11 02:29:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-10-11 02:29:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 181 transitions. [2021-10-11 02:29:26,593 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 181 transitions. Word has length 11 [2021-10-11 02:29:26,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:26,593 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 181 transitions. [2021-10-11 02:29:26,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:29:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 181 transitions. [2021-10-11 02:29:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:29:26,594 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:26,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:26,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:29:26,595 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:26,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:26,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2000773192, now seen corresponding path program 1 times [2021-10-11 02:29:26,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:26,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736840124] [2021-10-11 02:29:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:26,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736840124] [2021-10-11 02:29:26,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:26,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:29:26,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585488361] [2021-10-11 02:29:26,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:29:26,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:29:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:29:26,679 INFO L87 Difference]: Start difference. First operand 85 states and 181 transitions. Second operand 4 states. [2021-10-11 02:29:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:26,707 INFO L93 Difference]: Finished difference Result 121 states and 256 transitions. [2021-10-11 02:29:26,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:29:26,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-10-11 02:29:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:26,709 INFO L225 Difference]: With dead ends: 121 [2021-10-11 02:29:26,709 INFO L226 Difference]: Without dead ends: 73 [2021-10-11 02:29:26,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:29:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-10-11 02:29:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-10-11 02:29:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-10-11 02:29:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 149 transitions. [2021-10-11 02:29:26,720 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 149 transitions. Word has length 12 [2021-10-11 02:29:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:26,720 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 149 transitions. [2021-10-11 02:29:26,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:29:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 149 transitions. [2021-10-11 02:29:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:29:26,721 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:26,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:26,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:29:26,721 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:26,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:26,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2000800162, now seen corresponding path program 2 times [2021-10-11 02:29:26,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:26,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656187891] [2021-10-11 02:29:26,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:26,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656187891] [2021-10-11 02:29:26,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:26,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:29:26,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326681778] [2021-10-11 02:29:26,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:29:26,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:26,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:29:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:29:26,936 INFO L87 Difference]: Start difference. First operand 73 states and 149 transitions. Second operand 5 states. [2021-10-11 02:29:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:27,023 INFO L93 Difference]: Finished difference Result 71 states and 143 transitions. [2021-10-11 02:29:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:29:27,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2021-10-11 02:29:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:27,024 INFO L225 Difference]: With dead ends: 71 [2021-10-11 02:29:27,025 INFO L226 Difference]: Without dead ends: 71 [2021-10-11 02:29:27,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:29:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-10-11 02:29:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-10-11 02:29:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-10-11 02:29:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 143 transitions. [2021-10-11 02:29:27,028 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 143 transitions. Word has length 12 [2021-10-11 02:29:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:27,028 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 143 transitions. [2021-10-11 02:29:27,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:29:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 143 transitions. [2021-10-11 02:29:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 02:29:27,029 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:27,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:27,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:29:27,029 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:27,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1895264155, now seen corresponding path program 1 times [2021-10-11 02:29:27,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:27,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540088826] [2021-10-11 02:29:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:27,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-10-11 02:29:27,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540088826] [2021-10-11 02:29:27,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:27,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:29:27,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449100135] [2021-10-11 02:29:27,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:29:27,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:27,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:29:27,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:29:27,102 INFO L87 Difference]: Start difference. First operand 71 states and 143 transitions. Second operand 4 states. [2021-10-11 02:29:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:27,127 INFO L93 Difference]: Finished difference Result 62 states and 105 transitions. [2021-10-11 02:29:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:29:27,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2021-10-11 02:29:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:27,129 INFO L225 Difference]: With dead ends: 62 [2021-10-11 02:29:27,129 INFO L226 Difference]: Without dead ends: 43 [2021-10-11 02:29:27,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:29:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-10-11 02:29:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-10-11 02:29:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2021-10-11 02:29:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2021-10-11 02:29:27,131 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 13 [2021-10-11 02:29:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:27,132 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2021-10-11 02:29:27,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:29:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2021-10-11 02:29:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:29:27,133 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:27,133 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:27,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:29:27,133 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2033691372, now seen corresponding path program 1 times [2021-10-11 02:29:27,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:27,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162677271] [2021-10-11 02:29:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:27,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-10-11 02:29:27,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162677271] [2021-10-11 02:29:27,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:27,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:29:27,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702859132] [2021-10-11 02:29:27,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:29:27,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:27,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:29:27,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:29:27,203 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 5 states. [2021-10-11 02:29:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:27,235 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2021-10-11 02:29:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:29:27,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-10-11 02:29:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:27,237 INFO L225 Difference]: With dead ends: 33 [2021-10-11 02:29:27,237 INFO L226 Difference]: Without dead ends: 26 [2021-10-11 02:29:27,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:29:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-11 02:29:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-11 02:29:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-11 02:29:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-11 02:29:27,239 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2021-10-11 02:29:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:27,239 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-11 02:29:27,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:29:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-11 02:29:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:29:27,240 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:27,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:27,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:29:27,241 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash -691084062, now seen corresponding path program 1 times [2021-10-11 02:29:27,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:27,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821700380] [2021-10-11 02:29:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:29:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:29:27,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821700380] [2021-10-11 02:29:27,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:29:27,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:29:27,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59804016] [2021-10-11 02:29:27,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:29:27,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:27,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:29:27,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:29:27,387 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 6 states. [2021-10-11 02:29:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:27,472 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2021-10-11 02:29:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:29:27,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-10-11 02:29:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:27,473 INFO L225 Difference]: With dead ends: 34 [2021-10-11 02:29:27,474 INFO L226 Difference]: Without dead ends: 22 [2021-10-11 02:29:27,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:29:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-10-11 02:29:27,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-10-11 02:29:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-11 02:29:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-10-11 02:29:27,475 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2021-10-11 02:29:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:27,475 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-10-11 02:29:27,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:29:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-10-11 02:29:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:29:27,476 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:27,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:27,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:29:27,477 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:27,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:27,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1509522664, now seen corresponding path program 2 times [2021-10-11 02:29:27,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:27,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802765474] [2021-10-11 02:29:27,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:29:27,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:29:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:29:27,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:29:27,593 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:29:27,593 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:29:27,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:29:27,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:29:27 BasicIcfg [2021-10-11 02:29:27,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:29:27,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:29:27,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:29:27,654 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:29:27,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:29:02" (3/4) ... [2021-10-11 02:29:27,656 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:29:27,739 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f72770a0-8cef-4829-b367-eb0c9889d13d/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:29:27,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:29:27,740 INFO L168 Benchmark]: Toolchain (without parser) took 28225.84 ms. Allocated memory was 115.3 MB in the beginning and 388.0 MB in the end (delta: 272.6 MB). Free memory was 72.1 MB in the beginning and 220.5 MB in the end (delta: -148.4 MB). Peak memory consumption was 122.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:27,741 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 115.3 MB. Free memory was 90.2 MB in the beginning and 90.1 MB in the end (delta: 62.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:29:27,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.68 ms. Allocated memory is still 115.3 MB. Free memory was 71.9 MB in the beginning and 66.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:27,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.35 ms. Allocated memory is still 115.3 MB. Free memory was 66.8 MB in the beginning and 64.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:27,742 INFO L168 Benchmark]: Boogie Preprocessor took 75.03 ms. Allocated memory is still 115.3 MB. Free memory was 64.0 MB in the beginning and 62.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:27,742 INFO L168 Benchmark]: RCFGBuilder took 2231.71 ms. Allocated memory was 115.3 MB in the beginning and 138.4 MB in the end (delta: 23.1 MB). Free memory was 62.0 MB in the beginning and 63.2 MB in the end (delta: -1.3 MB). Peak memory consumption was 53.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:27,743 INFO L168 Benchmark]: TraceAbstraction took 25028.43 ms. Allocated memory was 138.4 MB in the beginning and 388.0 MB in the end (delta: 249.6 MB). Free memory was 63.2 MB in the beginning and 229.9 MB in the end (delta: -166.7 MB). Peak memory consumption was 83.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:27,743 INFO L168 Benchmark]: Witness Printer took 86.04 ms. Allocated memory is still 388.0 MB. Free memory was 229.9 MB in the beginning and 221.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:27,746 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.25 ms. Allocated memory is still 115.3 MB. Free memory was 90.2 MB in the beginning and 90.1 MB in the end (delta: 62.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 689.68 ms. Allocated memory is still 115.3 MB. Free memory was 71.9 MB in the beginning and 66.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 103.35 ms. Allocated memory is still 115.3 MB. Free memory was 66.8 MB in the beginning and 64.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.03 ms. Allocated memory is still 115.3 MB. Free memory was 64.0 MB in the beginning and 62.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2231.71 ms. Allocated memory was 115.3 MB in the beginning and 138.4 MB in the end (delta: 23.1 MB). Free memory was 62.0 MB in the beginning and 63.2 MB in the end (delta: -1.3 MB). Peak memory consumption was 53.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25028.43 ms. Allocated memory was 138.4 MB in the beginning and 388.0 MB in the end (delta: 249.6 MB). Free memory was 63.2 MB in the beginning and 229.9 MB in the end (delta: -166.7 MB). Peak memory consumption was 83.9 MB. Max. memory is 16.1 GB. * Witness Printer took 86.04 ms. Allocated memory is still 388.0 MB. Free memory was 229.9 MB in the beginning and 221.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 676 VarBasedMoverChecksPositive, 94 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 5.7s, 81 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 22.5s, 88 PlacesBefore, 28 PlacesAfterwards, 83 TransitionsBefore, 22 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 2978 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.8s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 22.5s, HoareTripleCheckerStatistics: 179 SDtfs, 129 SDslu, 187 SDs, 0 SdLazy, 135 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 8221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...