./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi002_rmo.oepc.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-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi002_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan --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 2f0c30194bf987dc019f417f4f93f07a29495b77 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 05:48:14,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:48:14,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:48:14,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:48:14,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:48:14,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:48:14,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:48:14,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:48:14,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:48:14,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:48:14,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:48:14,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:48:14,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:48:14,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:48:14,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:48:14,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:48:14,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:48:14,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:48:14,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:48:14,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:48:14,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:48:14,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:48:14,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:48:14,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:48:14,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:48:14,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:48:14,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:48:14,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:48:14,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:48:14,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:48:14,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:48:14,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:48:14,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:48:14,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:48:14,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:48:14,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:48:14,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:48:14,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:48:14,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:48:14,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:48:14,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:48:14,700 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 05:48:14,717 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:48:14,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:48:14,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:48:14,718 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:48:14,718 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:48:14,718 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:48:14,719 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 05:48:14,719 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:48:14,719 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:48:14,719 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 05:48:14,719 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 05:48:14,719 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:48:14,719 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 05:48:14,720 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 05:48:14,720 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 05:48:14,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:48:14,720 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:48:14,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:48:14,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:48:14,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:48:14,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 05:48:14,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:48:14,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 05:48:14,725 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 05:48:14,726 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:48:14,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 05:48:14,726 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:48:14,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 05:48:14,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:48:14,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:48:14,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:48:14,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:48:14,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:48:14,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 05:48:14,727 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 05:48:14,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 05:48:14,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 05:48:14,727 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:48:14,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:48:14,727 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-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/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-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan 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 -> 2f0c30194bf987dc019f417f4f93f07a29495b77 [2020-12-09 05:48:14,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:48:14,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:48:14,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:48:14,914 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:48:14,915 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:48:14,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi002_rmo.oepc.i [2020-12-09 05:48:14,958 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/data/8a5128241/a8ff07ccf9dd47f294eee939210d67df/FLAG9f4bf7cf3 [2020-12-09 05:48:15,386 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:48:15,386 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/sv-benchmarks/c/pthread-wmm/rfi002_rmo.oepc.i [2020-12-09 05:48:15,398 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/data/8a5128241/a8ff07ccf9dd47f294eee939210d67df/FLAG9f4bf7cf3 [2020-12-09 05:48:15,409 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/data/8a5128241/a8ff07ccf9dd47f294eee939210d67df [2020-12-09 05:48:15,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:48:15,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:48:15,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:48:15,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:48:15,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:48:15,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101d9e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15, skipping insertion in model container [2020-12-09 05:48:15,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:48:15,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:48:15,565 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/sv-benchmarks/c/pthread-wmm/rfi002_rmo.oepc.i[992,1005] [2020-12-09 05:48:15,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:48:15,706 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:48:15,714 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/sv-benchmarks/c/pthread-wmm/rfi002_rmo.oepc.i[992,1005] [2020-12-09 05:48:15,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:48:15,812 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:48:15,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15 WrapperNode [2020-12-09 05:48:15,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:48:15,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:48:15,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:48:15,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:48:15,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:48:15,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:48:15,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:48:15,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:48:15,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (1/1) ... [2020-12-09 05:48:15,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:48:15,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:48:15,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:48:15,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:48:15,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/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 [2020-12-09 05:48:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 05:48:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 05:48:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:48:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 05:48:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 05:48:15,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 05:48:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 05:48:15,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 05:48:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 05:48:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 05:48:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:48:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:48:15,981 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 05:48:18,217 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:48:18,218 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 05:48:18,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:48:18 BoogieIcfgContainer [2020-12-09 05:48:18,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:48:18,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:48:18,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:48:18,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:48:18,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:48:15" (1/3) ... [2020-12-09 05:48:18,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c406103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:48:18, skipping insertion in model container [2020-12-09 05:48:18,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:48:15" (2/3) ... [2020-12-09 05:48:18,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c406103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:48:18, skipping insertion in model container [2020-12-09 05:48:18,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:48:18" (3/3) ... [2020-12-09 05:48:18,225 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi002_rmo.oepc.i [2020-12-09 05:48:18,235 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 05:48:18,235 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:48:18,237 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 05:48:18,238 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 05:48:18,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,283 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,283 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,293 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,309 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,310 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,315 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,315 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:48:18,318 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 05:48:18,326 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-09 05:48:18,341 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:48:18,341 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 05:48:18,341 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:48:18,341 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:48:18,341 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:48:18,341 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:48:18,342 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:48:18,342 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:48:18,350 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 05:48:18,352 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 180 flow [2020-12-09 05:48:18,354 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 180 flow [2020-12-09 05:48:18,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2020-12-09 05:48:18,388 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2020-12-09 05:48:18,389 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 05:48:18,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2020-12-09 05:48:18,393 INFO L116 LiptonReduction]: Number of co-enabled transitions 1124 [2020-12-09 05:48:18,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:18,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:18,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:18,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:18,672 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:18,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:18,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:18,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:18,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:18,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:18,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:18,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:18,685 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 [2020-12-09 05:48:18,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:18,688 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 [2020-12-09 05:48:18,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:18,690 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 [2020-12-09 05:48:18,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:18,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:18,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:18,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:18,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:18,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 05:48:18,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:18,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 05:48:18,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:19,638 WARN L197 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-12-09 05:48:19,978 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-09 05:48:21,577 WARN L197 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2020-12-09 05:48:22,294 WARN L197 SmtUtils]: Spent 715.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2020-12-09 05:48:22,448 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:22,448 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:22,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:22,452 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:22,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:22,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:22,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:22,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:22,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:22,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:22,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:22,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:22,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:22,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:22,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:22,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:48:22,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:22,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:22,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:22,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:22,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:22,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:22,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:22,565 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:22,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:22,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:22,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:22,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:22,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:48:22,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:22,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:22,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:22,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:22,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:22,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:22,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:22,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:22,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:22,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:22,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:22,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:22,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:22,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:22,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:22,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:22,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:22,775 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:22,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:22,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:22,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:22,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:23,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:23,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:23,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:48:23,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:23,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:23,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:23,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:23,110 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,140 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:23,141 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:23,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:23,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:23,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 05:48:23,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:23,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:23,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:23,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,391 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:23,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,434 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:23,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,462 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:23,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:23,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:48:23,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:23,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:23,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:23,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,538 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,540 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:48:23,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,548 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:23,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:23,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:23,564 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,569 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,657 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,659 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,660 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:23,661 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:23,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:23,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:23,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,853 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:23,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 05:48:23,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:23,857 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 05:48:23,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,880 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:23,882 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,886 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:23,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,887 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 [2020-12-09 05:48:23,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,888 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 [2020-12-09 05:48:23,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,888 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 [2020-12-09 05:48:23,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:23,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,926 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:23,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:23,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:23,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:23,991 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:23,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:23,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:24,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:24,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:24,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:24,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:48:24,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:24,033 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:24,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:24,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,246 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-09 05:48:24,687 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-12-09 05:48:24,822 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 05:48:24,850 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:48:24,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:48:24,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,876 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,876 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,879 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,882 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:24,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:24,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:24,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:24,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:24,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:24,980 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,981 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:48:24,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:48:24,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,987 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:24,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:24,991 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:24,992 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 05:48:24,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:24,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:24,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:24,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:25,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:25,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:25,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:25,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:25,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:48:25,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:25,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:25,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:25,046 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:25,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:25,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:25,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,077 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:25,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:25,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:25,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:25,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:25,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:25,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:25,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:48:25,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:25,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:25,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:25,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:25,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,171 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:25,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:25,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,201 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:25,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:25,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:25,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,403 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:25,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:25,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:25,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:25,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:25,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:25,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,411 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 [2020-12-09 05:48:25,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,412 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 [2020-12-09 05:48:25,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,413 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 [2020-12-09 05:48:25,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:25,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:25,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 05:48:25,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:25,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 05:48:25,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:25,799 WARN L197 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-09 05:48:26,173 WARN L197 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-09 05:48:26,832 WARN L197 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2020-12-09 05:48:27,544 WARN L197 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2020-12-09 05:48:27,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:27,624 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:27,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:27,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:27,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:27,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:27,692 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,692 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:27,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:27,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:27,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:27,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:27,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:27,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:27,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:27,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:48:27,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:27,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 05:48:27,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:48:27,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:27,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:27,789 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:27,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:27,789 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:48:27,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:27,823 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 05:48:27,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:27,894 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:27,907 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,907 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:27,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:27,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:27,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:28,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:28,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:28,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:28,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,120 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:28,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:28,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:28,139 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,140 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,152 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:28,152 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:28,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:28,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 05:48:28,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:28,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,184 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:28,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 05:48:28,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:48:28,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-09 05:48:28,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:48:28,211 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,212 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-09 05:48:28,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,216 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 [2020-12-09 05:48:28,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,217 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 [2020-12-09 05:48:28,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,218 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 [2020-12-09 05:48:28,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,265 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:28,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:28,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 05:48:28,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:28,292 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 05:48:28,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:48:29,277 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-12-09 05:48:29,416 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-09 05:48:29,704 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-12-09 05:48:29,853 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-09 05:48:29,855 INFO L131 LiptonReduction]: Checked pairs total: 3210 [2020-12-09 05:48:29,855 INFO L133 LiptonReduction]: Total number of compositions: 75 [2020-12-09 05:48:29,860 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 23 transitions, 56 flow [2020-12-09 05:48:29,872 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 266 states. [2020-12-09 05:48:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states. [2020-12-09 05:48:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 05:48:29,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:29,877 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 05:48:29,878 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:29,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1600914985, now seen corresponding path program 1 times [2020-12-09 05:48:29,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:29,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284164306] [2020-12-09 05:48:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:30,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284164306] [2020-12-09 05:48:30,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:30,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 05:48:30,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670111769] [2020-12-09 05:48:30,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:48:30,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:30,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:48:30,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:48:30,050 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 3 states. [2020-12-09 05:48:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:30,120 INFO L93 Difference]: Finished difference Result 230 states and 564 transitions. [2020-12-09 05:48:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:48:30,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 05:48:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:30,131 INFO L225 Difference]: With dead ends: 230 [2020-12-09 05:48:30,131 INFO L226 Difference]: Without dead ends: 194 [2020-12-09 05:48:30,131 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 [2020-12-09 05:48:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-12-09 05:48:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-12-09 05:48:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-12-09 05:48:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 468 transitions. [2020-12-09 05:48:30,177 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 468 transitions. Word has length 5 [2020-12-09 05:48:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:30,177 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 468 transitions. [2020-12-09 05:48:30,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:48:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 468 transitions. [2020-12-09 05:48:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 05:48:30,178 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:30,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:30,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 05:48:30,179 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1544120838, now seen corresponding path program 1 times [2020-12-09 05:48:30,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:30,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108744379] [2020-12-09 05:48:30,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:30,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108744379] [2020-12-09 05:48:30,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:30,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:48:30,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822941218] [2020-12-09 05:48:30,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:48:30,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:30,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:48:30,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:48:30,310 INFO L87 Difference]: Start difference. First operand 194 states and 468 transitions. Second operand 4 states. [2020-12-09 05:48:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:30,334 INFO L93 Difference]: Finished difference Result 206 states and 472 transitions. [2020-12-09 05:48:30,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:48:30,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 05:48:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:30,336 INFO L225 Difference]: With dead ends: 206 [2020-12-09 05:48:30,336 INFO L226 Difference]: Without dead ends: 170 [2020-12-09 05:48:30,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:48:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-09 05:48:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2020-12-09 05:48:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-09 05:48:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 400 transitions. [2020-12-09 05:48:30,345 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 400 transitions. Word has length 8 [2020-12-09 05:48:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:30,345 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 400 transitions. [2020-12-09 05:48:30,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:48:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 400 transitions. [2020-12-09 05:48:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 05:48:30,346 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:30,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:30,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 05:48:30,347 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1118146374, now seen corresponding path program 1 times [2020-12-09 05:48:30,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:30,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988113151] [2020-12-09 05:48:30,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:30,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988113151] [2020-12-09 05:48:30,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:30,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:48:30,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224544865] [2020-12-09 05:48:30,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:48:30,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:48:30,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:48:30,418 INFO L87 Difference]: Start difference. First operand 170 states and 400 transitions. Second operand 4 states. [2020-12-09 05:48:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:30,450 INFO L93 Difference]: Finished difference Result 170 states and 384 transitions. [2020-12-09 05:48:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:48:30,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 05:48:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:30,452 INFO L225 Difference]: With dead ends: 170 [2020-12-09 05:48:30,452 INFO L226 Difference]: Without dead ends: 146 [2020-12-09 05:48:30,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:48:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-12-09 05:48:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2020-12-09 05:48:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-12-09 05:48:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 334 transitions. [2020-12-09 05:48:30,461 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 334 transitions. Word has length 10 [2020-12-09 05:48:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:30,461 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 334 transitions. [2020-12-09 05:48:30,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:48:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 334 transitions. [2020-12-09 05:48:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 05:48:30,463 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:30,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:30,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 05:48:30,463 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:30,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash -249359735, now seen corresponding path program 1 times [2020-12-09 05:48:30,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:30,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8850205] [2020-12-09 05:48:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:30,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8850205] [2020-12-09 05:48:30,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:30,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 05:48:30,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761967906] [2020-12-09 05:48:30,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 05:48:30,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:30,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 05:48:30,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:48:30,692 INFO L87 Difference]: Start difference. First operand 146 states and 334 transitions. Second operand 9 states. [2020-12-09 05:48:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:30,934 INFO L93 Difference]: Finished difference Result 185 states and 417 transitions. [2020-12-09 05:48:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 05:48:30,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-12-09 05:48:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:30,936 INFO L225 Difference]: With dead ends: 185 [2020-12-09 05:48:30,936 INFO L226 Difference]: Without dead ends: 171 [2020-12-09 05:48:30,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:48:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-09 05:48:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2020-12-09 05:48:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-12-09 05:48:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 376 transitions. [2020-12-09 05:48:30,943 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 376 transitions. Word has length 13 [2020-12-09 05:48:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:30,944 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 376 transitions. [2020-12-09 05:48:30,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 05:48:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 376 transitions. [2020-12-09 05:48:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 05:48:30,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:30,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:30,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 05:48:30,945 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:30,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1012363259, now seen corresponding path program 2 times [2020-12-09 05:48:30,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:30,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841740646] [2020-12-09 05:48:30,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:31,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841740646] [2020-12-09 05:48:31,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:31,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 05:48:31,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501696157] [2020-12-09 05:48:31,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 05:48:31,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:31,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 05:48:31,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:48:31,130 INFO L87 Difference]: Start difference. First operand 164 states and 376 transitions. Second operand 8 states. [2020-12-09 05:48:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:31,349 INFO L93 Difference]: Finished difference Result 217 states and 489 transitions. [2020-12-09 05:48:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 05:48:31,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-12-09 05:48:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:31,351 INFO L225 Difference]: With dead ends: 217 [2020-12-09 05:48:31,351 INFO L226 Difference]: Without dead ends: 205 [2020-12-09 05:48:31,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:48:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-12-09 05:48:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 183. [2020-12-09 05:48:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-12-09 05:48:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 421 transitions. [2020-12-09 05:48:31,357 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 421 transitions. Word has length 13 [2020-12-09 05:48:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:31,357 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 421 transitions. [2020-12-09 05:48:31,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 05:48:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 421 transitions. [2020-12-09 05:48:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 05:48:31,358 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:31,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:31,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 05:48:31,358 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:31,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:31,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1169894979, now seen corresponding path program 3 times [2020-12-09 05:48:31,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:31,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591965742] [2020-12-09 05:48:31,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:31,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591965742] [2020-12-09 05:48:31,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:31,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 05:48:31,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119711620] [2020-12-09 05:48:31,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 05:48:31,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:31,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 05:48:31,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:48:31,486 INFO L87 Difference]: Start difference. First operand 183 states and 421 transitions. Second operand 9 states. [2020-12-09 05:48:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:31,708 INFO L93 Difference]: Finished difference Result 232 states and 525 transitions. [2020-12-09 05:48:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 05:48:31,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-12-09 05:48:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:31,710 INFO L225 Difference]: With dead ends: 232 [2020-12-09 05:48:31,710 INFO L226 Difference]: Without dead ends: 219 [2020-12-09 05:48:31,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:48:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-12-09 05:48:31,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 183. [2020-12-09 05:48:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-12-09 05:48:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 422 transitions. [2020-12-09 05:48:31,715 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 422 transitions. Word has length 13 [2020-12-09 05:48:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:31,716 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 422 transitions. [2020-12-09 05:48:31,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 05:48:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 422 transitions. [2020-12-09 05:48:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 05:48:31,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:31,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:31,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 05:48:31,717 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:31,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:31,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1319476505, now seen corresponding path program 4 times [2020-12-09 05:48:31,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:31,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078348062] [2020-12-09 05:48:31,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:31,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078348062] [2020-12-09 05:48:31,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:31,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 05:48:31,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645395] [2020-12-09 05:48:31,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 05:48:31,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 05:48:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:48:31,832 INFO L87 Difference]: Start difference. First operand 183 states and 422 transitions. Second operand 8 states. [2020-12-09 05:48:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:32,064 INFO L93 Difference]: Finished difference Result 222 states and 504 transitions. [2020-12-09 05:48:32,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 05:48:32,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-12-09 05:48:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:32,066 INFO L225 Difference]: With dead ends: 222 [2020-12-09 05:48:32,066 INFO L226 Difference]: Without dead ends: 207 [2020-12-09 05:48:32,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-12-09 05:48:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-09 05:48:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2020-12-09 05:48:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-12-09 05:48:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 429 transitions. [2020-12-09 05:48:32,071 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 429 transitions. Word has length 13 [2020-12-09 05:48:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:32,072 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 429 transitions. [2020-12-09 05:48:32,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 05:48:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 429 transitions. [2020-12-09 05:48:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 05:48:32,072 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:32,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:32,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 05:48:32,073 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash 859722214, now seen corresponding path program 1 times [2020-12-09 05:48:32,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:32,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101890090] [2020-12-09 05:48:32,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:32,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101890090] [2020-12-09 05:48:32,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:32,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:48:32,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945711123] [2020-12-09 05:48:32,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 05:48:32,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:32,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 05:48:32,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:48:32,217 INFO L87 Difference]: Start difference. First operand 186 states and 429 transitions. Second operand 7 states. [2020-12-09 05:48:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:32,357 INFO L93 Difference]: Finished difference Result 268 states and 612 transitions. [2020-12-09 05:48:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:48:32,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-09 05:48:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:32,358 INFO L225 Difference]: With dead ends: 268 [2020-12-09 05:48:32,358 INFO L226 Difference]: Without dead ends: 174 [2020-12-09 05:48:32,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:48:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-09 05:48:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-12-09 05:48:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-12-09 05:48:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 385 transitions. [2020-12-09 05:48:32,363 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 385 transitions. Word has length 14 [2020-12-09 05:48:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:32,363 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 385 transitions. [2020-12-09 05:48:32,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 05:48:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 385 transitions. [2020-12-09 05:48:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 05:48:32,364 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:32,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:32,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 05:48:32,364 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:32,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1955478493, now seen corresponding path program 1 times [2020-12-09 05:48:32,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:32,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662074796] [2020-12-09 05:48:32,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:32,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662074796] [2020-12-09 05:48:32,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:32,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 05:48:32,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2938869] [2020-12-09 05:48:32,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 05:48:32,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 05:48:32,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:48:32,663 INFO L87 Difference]: Start difference. First operand 174 states and 385 transitions. Second operand 10 states. [2020-12-09 05:48:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:32,904 INFO L93 Difference]: Finished difference Result 192 states and 414 transitions. [2020-12-09 05:48:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 05:48:32,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-12-09 05:48:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:32,906 INFO L225 Difference]: With dead ends: 192 [2020-12-09 05:48:32,906 INFO L226 Difference]: Without dead ends: 184 [2020-12-09 05:48:32,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:48:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-09 05:48:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 167. [2020-12-09 05:48:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-12-09 05:48:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 374 transitions. [2020-12-09 05:48:32,911 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 374 transitions. Word has length 14 [2020-12-09 05:48:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:32,911 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 374 transitions. [2020-12-09 05:48:32,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 05:48:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 374 transitions. [2020-12-09 05:48:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 05:48:32,911 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:32,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:32,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 05:48:32,912 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:32,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1318429364, now seen corresponding path program 2 times [2020-12-09 05:48:32,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:32,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454040283] [2020-12-09 05:48:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:33,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454040283] [2020-12-09 05:48:33,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:33,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 05:48:33,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744493711] [2020-12-09 05:48:33,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 05:48:33,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:33,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 05:48:33,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:48:33,108 INFO L87 Difference]: Start difference. First operand 167 states and 374 transitions. Second operand 9 states. [2020-12-09 05:48:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:33,346 INFO L93 Difference]: Finished difference Result 186 states and 407 transitions. [2020-12-09 05:48:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:48:33,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-12-09 05:48:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:33,348 INFO L225 Difference]: With dead ends: 186 [2020-12-09 05:48:33,348 INFO L226 Difference]: Without dead ends: 175 [2020-12-09 05:48:33,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:48:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-09 05:48:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2020-12-09 05:48:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-09 05:48:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 373 transitions. [2020-12-09 05:48:33,352 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 373 transitions. Word has length 14 [2020-12-09 05:48:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:33,352 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 373 transitions. [2020-12-09 05:48:33,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 05:48:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 373 transitions. [2020-12-09 05:48:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 05:48:33,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:33,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:33,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 05:48:33,353 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:33,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:33,353 INFO L82 PathProgramCache]: Analyzing trace with hash -211427439, now seen corresponding path program 2 times [2020-12-09 05:48:33,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:33,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396288565] [2020-12-09 05:48:33,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:33,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396288565] [2020-12-09 05:48:33,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:33,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 05:48:33,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60592689] [2020-12-09 05:48:33,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 05:48:33,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:33,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 05:48:33,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:48:33,492 INFO L87 Difference]: Start difference. First operand 168 states and 373 transitions. Second operand 8 states. [2020-12-09 05:48:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:33,617 INFO L93 Difference]: Finished difference Result 172 states and 375 transitions. [2020-12-09 05:48:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:48:33,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-12-09 05:48:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:33,619 INFO L225 Difference]: With dead ends: 172 [2020-12-09 05:48:33,619 INFO L226 Difference]: Without dead ends: 164 [2020-12-09 05:48:33,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:48:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-09 05:48:33,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 134. [2020-12-09 05:48:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-12-09 05:48:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 292 transitions. [2020-12-09 05:48:33,623 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 292 transitions. Word has length 14 [2020-12-09 05:48:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:33,623 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 292 transitions. [2020-12-09 05:48:33,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 05:48:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 292 transitions. [2020-12-09 05:48:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 05:48:33,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:33,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:33,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 05:48:33,624 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:33,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:33,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2078422308, now seen corresponding path program 1 times [2020-12-09 05:48:33,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:33,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716179410] [2020-12-09 05:48:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:33,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716179410] [2020-12-09 05:48:33,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:33,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 05:48:33,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129446325] [2020-12-09 05:48:33,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 05:48:33,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:33,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 05:48:33,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:48:33,773 INFO L87 Difference]: Start difference. First operand 134 states and 292 transitions. Second operand 8 states. [2020-12-09 05:48:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:33,927 INFO L93 Difference]: Finished difference Result 175 states and 380 transitions. [2020-12-09 05:48:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:48:33,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-12-09 05:48:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:33,929 INFO L225 Difference]: With dead ends: 175 [2020-12-09 05:48:33,929 INFO L226 Difference]: Without dead ends: 140 [2020-12-09 05:48:33,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:48:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-12-09 05:48:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2020-12-09 05:48:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-12-09 05:48:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 292 transitions. [2020-12-09 05:48:33,933 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 292 transitions. Word has length 15 [2020-12-09 05:48:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:33,934 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 292 transitions. [2020-12-09 05:48:33,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 05:48:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 292 transitions. [2020-12-09 05:48:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 05:48:33,935 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:33,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:33,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 05:48:33,935 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:33,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1705945464, now seen corresponding path program 2 times [2020-12-09 05:48:33,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:33,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531814259] [2020-12-09 05:48:33,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:34,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531814259] [2020-12-09 05:48:34,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:34,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 05:48:34,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991925830] [2020-12-09 05:48:34,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 05:48:34,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 05:48:34,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:48:34,215 INFO L87 Difference]: Start difference. First operand 134 states and 292 transitions. Second operand 10 states. [2020-12-09 05:48:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:34,545 INFO L93 Difference]: Finished difference Result 210 states and 455 transitions. [2020-12-09 05:48:34,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 05:48:34,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-12-09 05:48:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:34,547 INFO L225 Difference]: With dead ends: 210 [2020-12-09 05:48:34,547 INFO L226 Difference]: Without dead ends: 170 [2020-12-09 05:48:34,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:48:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-09 05:48:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 155. [2020-12-09 05:48:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-12-09 05:48:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 339 transitions. [2020-12-09 05:48:34,550 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 339 transitions. Word has length 15 [2020-12-09 05:48:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:34,551 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 339 transitions. [2020-12-09 05:48:34,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 05:48:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 339 transitions. [2020-12-09 05:48:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 05:48:34,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:34,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:34,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 05:48:34,551 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1705955074, now seen corresponding path program 1 times [2020-12-09 05:48:34,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:34,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860509946] [2020-12-09 05:48:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:34,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860509946] [2020-12-09 05:48:34,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:34,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 05:48:34,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679386653] [2020-12-09 05:48:34,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 05:48:34,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:34,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 05:48:34,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:48:34,775 INFO L87 Difference]: Start difference. First operand 155 states and 339 transitions. Second operand 10 states. [2020-12-09 05:48:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:34,975 INFO L93 Difference]: Finished difference Result 202 states and 432 transitions. [2020-12-09 05:48:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 05:48:34,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-12-09 05:48:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:34,977 INFO L225 Difference]: With dead ends: 202 [2020-12-09 05:48:34,977 INFO L226 Difference]: Without dead ends: 163 [2020-12-09 05:48:34,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:48:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-09 05:48:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2020-12-09 05:48:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-12-09 05:48:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 328 transitions. [2020-12-09 05:48:34,980 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 328 transitions. Word has length 15 [2020-12-09 05:48:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:34,980 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 328 transitions. [2020-12-09 05:48:34,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 05:48:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 328 transitions. [2020-12-09 05:48:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 05:48:34,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:34,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:34,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 05:48:34,981 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:34,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:34,982 INFO L82 PathProgramCache]: Analyzing trace with hash 989709750, now seen corresponding path program 3 times [2020-12-09 05:48:34,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:34,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932138093] [2020-12-09 05:48:34,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:35,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932138093] [2020-12-09 05:48:35,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:35,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 05:48:35,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797617269] [2020-12-09 05:48:35,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 05:48:35,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:35,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 05:48:35,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:48:35,107 INFO L87 Difference]: Start difference. First operand 154 states and 328 transitions. Second operand 9 states. [2020-12-09 05:48:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:35,291 INFO L93 Difference]: Finished difference Result 204 states and 434 transitions. [2020-12-09 05:48:35,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 05:48:35,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-12-09 05:48:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:35,293 INFO L225 Difference]: With dead ends: 204 [2020-12-09 05:48:35,293 INFO L226 Difference]: Without dead ends: 142 [2020-12-09 05:48:35,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:48:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-09 05:48:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-12-09 05:48:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-09 05:48:35,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 302 transitions. [2020-12-09 05:48:35,297 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 302 transitions. Word has length 15 [2020-12-09 05:48:35,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:35,298 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 302 transitions. [2020-12-09 05:48:35,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 05:48:35,298 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 302 transitions. [2020-12-09 05:48:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 05:48:35,298 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:35,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:35,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 05:48:35,299 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:35,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:35,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1003516610, now seen corresponding path program 2 times [2020-12-09 05:48:35,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:35,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618455633] [2020-12-09 05:48:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:35,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618455633] [2020-12-09 05:48:35,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:35,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 05:48:35,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896501200] [2020-12-09 05:48:35,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 05:48:35,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 05:48:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-12-09 05:48:35,542 INFO L87 Difference]: Start difference. First operand 142 states and 302 transitions. Second operand 11 states. [2020-12-09 05:48:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:35,779 INFO L93 Difference]: Finished difference Result 176 states and 362 transitions. [2020-12-09 05:48:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:48:35,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2020-12-09 05:48:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:35,781 INFO L225 Difference]: With dead ends: 176 [2020-12-09 05:48:35,781 INFO L226 Difference]: Without dead ends: 147 [2020-12-09 05:48:35,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:48:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-12-09 05:48:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2020-12-09 05:48:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-12-09 05:48:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 289 transitions. [2020-12-09 05:48:35,784 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 289 transitions. Word has length 15 [2020-12-09 05:48:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:35,784 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 289 transitions. [2020-12-09 05:48:35,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 05:48:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 289 transitions. [2020-12-09 05:48:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 05:48:35,785 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:35,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:35,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 05:48:35,785 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:35,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:35,785 INFO L82 PathProgramCache]: Analyzing trace with hash 156677364, now seen corresponding path program 4 times [2020-12-09 05:48:35,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:35,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241886971] [2020-12-09 05:48:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:36,057 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2020-12-09 05:48:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:36,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241886971] [2020-12-09 05:48:36,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:36,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 05:48:36,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856760906] [2020-12-09 05:48:36,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 05:48:36,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:36,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 05:48:36,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:48:36,119 INFO L87 Difference]: Start difference. First operand 134 states and 289 transitions. Second operand 10 states. [2020-12-09 05:48:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:36,773 INFO L93 Difference]: Finished difference Result 233 states and 483 transitions. [2020-12-09 05:48:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 05:48:36,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-12-09 05:48:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:36,774 INFO L225 Difference]: With dead ends: 233 [2020-12-09 05:48:36,774 INFO L226 Difference]: Without dead ends: 133 [2020-12-09 05:48:36,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2020-12-09 05:48:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-09 05:48:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2020-12-09 05:48:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-09 05:48:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 237 transitions. [2020-12-09 05:48:36,777 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 237 transitions. Word has length 15 [2020-12-09 05:48:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:36,777 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 237 transitions. [2020-12-09 05:48:36,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 05:48:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 237 transitions. [2020-12-09 05:48:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 05:48:36,778 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:48:36,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:48:36,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 05:48:36,778 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:48:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:48:36,778 INFO L82 PathProgramCache]: Analyzing trace with hash 156667754, now seen corresponding path program 3 times [2020-12-09 05:48:36,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:48:36,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243002355] [2020-12-09 05:48:36,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:48:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:48:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:48:36,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243002355] [2020-12-09 05:48:36,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:48:36,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 05:48:36,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686637460] [2020-12-09 05:48:36,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 05:48:36,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:48:36,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 05:48:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:48:36,956 INFO L87 Difference]: Start difference. First operand 119 states and 237 transitions. Second operand 10 states. [2020-12-09 05:48:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:48:37,198 INFO L93 Difference]: Finished difference Result 111 states and 219 transitions. [2020-12-09 05:48:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:48:37,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-12-09 05:48:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:48:37,199 INFO L225 Difference]: With dead ends: 111 [2020-12-09 05:48:37,199 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 05:48:37,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:48:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 05:48:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 05:48:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 05:48:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 05:48:37,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-12-09 05:48:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:48:37,201 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 05:48:37,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 05:48:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 05:48:37,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 05:48:37,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-09 05:48:37,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:48:37 BasicIcfg [2020-12-09 05:48:37,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 05:48:37,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 05:48:37,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 05:48:37,204 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 05:48:37,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:48:18" (3/4) ... [2020-12-09 05:48:37,207 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 05:48:37,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2020-12-09 05:48:37,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2020-12-09 05:48:37,222 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 110 nodes and edges [2020-12-09 05:48:37,222 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2020-12-09 05:48:37,223 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-12-09 05:48:37,224 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 05:48:37,272 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_00b6e9dd-0526-4e11-8728-5f716e331b19/bin/utaipan/witness.graphml [2020-12-09 05:48:37,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 05:48:37,273 INFO L168 Benchmark]: Toolchain (without parser) took 21860.89 ms. Allocated memory was 115.3 MB in the beginning and 293.6 MB in the end (delta: 178.3 MB). Free memory was 93.2 MB in the beginning and 238.4 MB in the end (delta: -145.2 MB). Peak memory consumption was 33.5 MB. Max. memory is 16.1 GB. [2020-12-09 05:48:37,273 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 83.9 MB. Free memory is still 60.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:48:37,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.84 ms. Allocated memory is still 115.3 MB. Free memory was 92.9 MB in the beginning and 56.5 MB in the end (delta: 36.4 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2020-12-09 05:48:37,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.89 ms. Allocated memory is still 115.3 MB. Free memory was 56.5 MB in the beginning and 53.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 05:48:37,274 INFO L168 Benchmark]: Boogie Preprocessor took 38.31 ms. Allocated memory is still 115.3 MB. Free memory was 53.4 MB in the beginning and 50.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:48:37,274 INFO L168 Benchmark]: RCFGBuilder took 2314.22 ms. Allocated memory was 115.3 MB in the beginning and 138.4 MB in the end (delta: 23.1 MB). Free memory was 50.2 MB in the beginning and 48.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 39.4 MB. Max. memory is 16.1 GB. [2020-12-09 05:48:37,274 INFO L168 Benchmark]: TraceAbstraction took 18983.37 ms. Allocated memory was 138.4 MB in the beginning and 293.6 MB in the end (delta: 155.2 MB). Free memory was 48.0 MB in the beginning and 246.8 MB in the end (delta: -198.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:48:37,274 INFO L168 Benchmark]: Witness Printer took 67.74 ms. Allocated memory is still 293.6 MB. Free memory was 246.8 MB in the beginning and 238.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 05:48:37,276 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.16 ms. Allocated memory is still 83.9 MB. Free memory is still 60.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 399.84 ms. Allocated memory is still 115.3 MB. Free memory was 92.9 MB in the beginning and 56.5 MB in the end (delta: 36.4 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.89 ms. Allocated memory is still 115.3 MB. Free memory was 56.5 MB in the beginning and 53.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.31 ms. Allocated memory is still 115.3 MB. Free memory was 53.4 MB in the beginning and 50.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2314.22 ms. Allocated memory was 115.3 MB in the beginning and 138.4 MB in the end (delta: 23.1 MB). Free memory was 50.2 MB in the beginning and 48.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 39.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18983.37 ms. Allocated memory was 138.4 MB in the beginning and 293.6 MB in the end (delta: 155.2 MB). Free memory was 48.0 MB in the beginning and 246.8 MB in the end (delta: -198.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 67.74 ms. Allocated memory is still 293.6 MB. Free memory was 246.8 MB in the beginning and 238.4 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 688 VarBasedMoverChecksPositive, 68 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 84 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.5s, 90 PlacesBefore, 29 PlacesAfterwards, 85 TransitionsBefore, 23 TransitionsAfterwards, 1124 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 3210 MoverChecksTotal - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 84 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 369 SDtfs, 469 SDslu, 1216 SDs, 0 SdLazy, 1577 SolverSat, 351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred 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, 18 MinimizatonAttempts, 197 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 42040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 correct! Received shutdown request...