./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_power.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_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6acc3ad60a4c54b694ac7457dd17b9ea9d4405b0
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
--- Real Ultimate output ---
This is Ultimate 0.2.0-7b2dab5
[2021-10-11 00:33:51,562 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-10-11 00:33:51,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-11 00:33:51,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-11 00:33:51,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-11 00:33:51,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-11 00:33:51,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-11 00:33:51,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-11 00:33:51,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-11 00:33:51,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-11 00:33:51,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-10-11 00:33:51,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-11 00:33:51,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-11 00:33:51,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-11 00:33:51,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-11 00:33:51,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-11 00:33:51,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-11 00:33:51,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-11 00:33:51,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-11 00:33:51,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-11 00:33:51,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-11 00:33:51,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-11 00:33:51,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-10-11 00:33:51,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-11 00:33:51,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-11 00:33:51,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-11 00:33:51,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-11 00:33:51,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-11 00:33:51,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-11 00:33:51,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-11 00:33:51,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-11 00:33:51,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-11 00:33:51,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-11 00:33:51,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-11 00:33:51,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-11 00:33:51,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-11 00:33:51,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-11 00:33:51,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-11 00:33:51,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-11 00:33:51,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-11 00:33:51,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-10-11 00:33:51,680 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-11 00:33:51,721 INFO L113 SettingsManager]: Loading preferences was successful
[2021-10-11 00:33:51,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-11 00:33:51,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-11 00:33:51,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-10-11 00:33:51,723 INFO L138 SettingsManager]: * Use SBE=true
[2021-10-11 00:33:51,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-11 00:33:51,723 INFO L138 SettingsManager]: * sizeof long=4
[2021-10-11 00:33:51,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-10-11 00:33:51,723 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-10-11 00:33:51,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-10-11 00:33:51,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-10-11 00:33:51,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-11 00:33:51,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-10-11 00:33:51,737 INFO L138 SettingsManager]: * sizeof long double=12
[2021-10-11 00:33:51,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-10-11 00:33:51,738 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-10-11 00:33:51,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-10-11 00:33:51,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-11 00:33:51,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-10-11 00:33:51,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-10-11 00:33:51,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:33:51,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-11 00:33:51,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-10-11 00:33:51,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-11 00:33:51,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-10-11 00:33:51,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-11 00:33:51,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-11 00:33:51,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-10-11 00:33:51,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC
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 -> Automizer
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 -> 6acc3ad60a4c54b694ac7457dd17b9ea9d4405b0
[2021-10-11 00:33:52,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-11 00:33:52,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-11 00:33:52,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-11 00:33:52,061 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-10-11 00:33:52,062 INFO L275 PluginConnector]: CDTParser initialized
[2021-10-11 00:33:52,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc.i
[2021-10-11 00:33:52,154 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/data/9ca347a3b/f82437761ff24fe6a9f96cd19029f0b7/FLAG4c5d5c81f
[2021-10-11 00:33:52,743 INFO L306 CDTParser]: Found 1 translation units.
[2021-10-11 00:33:52,743 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/sv-benchmarks/c/pthread-wmm/mix018_power.oepc.i
[2021-10-11 00:33:52,776 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/data/9ca347a3b/f82437761ff24fe6a9f96cd19029f0b7/FLAG4c5d5c81f
[2021-10-11 00:33:53,023 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/data/9ca347a3b/f82437761ff24fe6a9f96cd19029f0b7
[2021-10-11 00:33:53,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-11 00:33:53,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-11 00:33:53,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-11 00:33:53,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-11 00:33:53,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-11 00:33:53,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf545fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53, skipping insertion in model container
[2021-10-11 00:33:53,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-10-11 00:33:53,117 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-10-11 00:33:53,261 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/sv-benchmarks/c/pthread-wmm/mix018_power.oepc.i[951,964]
[2021-10-11 00:33:53,483 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:33:53,492 INFO L203 MainTranslator]: Completed pre-run
[2021-10-11 00:33:53,505 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/sv-benchmarks/c/pthread-wmm/mix018_power.oepc.i[951,964]
[2021-10-11 00:33:53,559 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:33:53,636 INFO L208 MainTranslator]: Completed translation
[2021-10-11 00:33:53,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53 WrapperNode
[2021-10-11 00:33:53,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-11 00:33:53,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-11 00:33:53,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-11 00:33:53,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-11 00:33:53,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-11 00:33:53,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-11 00:33:53,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-11 00:33:53,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-10-11 00:33:53,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (1/1) ...
[2021-10-11 00:33:53,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-11 00:33:53,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-11 00:33:53,738 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-10-11 00:33:53,738 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-10-11 00:33:53,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (1/1) ...
No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:33:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-10-11 00:33:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-10-11 00:33:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-11 00:33:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-11 00:33:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-10-11 00:33:53,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-10-11 00:33:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-10-11 00:33:53,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-10-11 00:33:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-10-11 00:33:53,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-10-11 00:33:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2021-10-11 00:33:53,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2021-10-11 00:33:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-11 00:33:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-10-11 00:33:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-11 00:33:53,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-11 00:33:53,836 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-10-11 00:33:56,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-11 00:33:56,533 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-10-11 00:33:56,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:56 BoogieIcfgContainer
[2021-10-11 00:33:56,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-11 00:33:56,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-11 00:33:56,538 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-10-11 00:33:56,541 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-10-11 00:33:56,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:33:53" (1/3) ...
[2021-10-11 00:33:56,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dbe4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:33:56, skipping insertion in model container
[2021-10-11 00:33:56,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:53" (2/3) ...
[2021-10-11 00:33:56,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dbe4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:33:56, skipping insertion in model container
[2021-10-11 00:33:56,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:56" (3/3) ...
[2021-10-11 00:33:56,545 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc.i
[2021-10-11 00:33:56,559 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-10-11 00:33:56,560 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-11 00:33:56,563 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-10-11 00:33:56,564 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-10-11 00:33:56,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,609 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,609 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,610 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,610 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,610 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,610 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,611 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,611 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,616 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,616 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,617 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,617 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,622 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,622 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,622 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,623 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,627 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,627 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,628 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,628 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,629 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,634 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,653 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,653 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,654 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,656 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,656 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,659 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,659 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,666 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,667 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,667 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,669 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,670 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,671 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,671 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,671 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:56,673 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-10-11 00:33:56,684 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2021-10-11 00:33:56,704 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2021-10-11 00:33:56,704 INFO L378 AbstractCegarLoop]: Hoare is true
[2021-10-11 00:33:56,705 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-10-11 00:33:56,705 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-11 00:33:56,705 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-11 00:33:56,705 INFO L382 AbstractCegarLoop]: Difference is false
[2021-10-11 00:33:56,705 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-11 00:33:56,705 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-10-11 00:33:56,717 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-10-11 00:33:56,719 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 118 transitions, 256 flow
[2021-10-11 00:33:56,721 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 118 transitions, 256 flow
[2021-10-11 00:33:56,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow
[2021-10-11 00:33:56,772 INFO L129 PetriNetUnfolder]: 2/114 cut-off events.
[2021-10-11 00:33:56,772 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-11 00:33:56,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place.
[2021-10-11 00:33:56,782 INFO L116 LiptonReduction]: Number of co-enabled transitions 2774
[2021-10-11 00:33:56,853 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:56,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:56,856 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:56,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:56,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:56,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:56,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:56,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:56,906 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:56,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:56,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:56,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:56,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:56,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:56,921 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:56,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:57,457 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-10-11 00:33:57,565 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 57
[2021-10-11 00:33:58,098 WARN L197 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88
[2021-10-11 00:33:58,321 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2021-10-11 00:33:58,367 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:58,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:58,369 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:58,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:58,372 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:58,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:58,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:58,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:58,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:58,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:58,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:58,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:58,414 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:58,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:58,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:58,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:58,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term
[2021-10-11 00:33:58,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:58,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:58,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:33:58,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:58,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:58,911 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:58,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:58,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:58,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:58,916 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:58,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:58,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:58,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:58,921 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:58,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:58,923 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:58,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:58,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:58,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:59,013 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,016 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,019 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,073 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,213 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,248 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,790 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:59,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:59,794 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:59,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:59,796 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:59,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:59,798 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:59,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:59,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:59,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:59,801 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:59,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:59,856 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:59,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:33:59,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:59,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:59,905 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,907 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,911 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,939 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,942 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:59,992 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:59,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:59,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,022 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,024 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,212 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,213 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,545 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,549 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,569 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,570 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,572 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:00,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:00,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:00,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:00,644 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:00,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:00,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:00,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:00,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:00,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:00,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:00,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:00,733 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:00,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:34:00,736 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:00,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:00,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,818 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term
[2021-10-11 00:34:00,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:01,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:01,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:34:01,105 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:01,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:01,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:01,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:01,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:01,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:01,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:01,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:01,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:01,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:01,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:01,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:01,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:01,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:01,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:01,573 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:01,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:01,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:01,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:01,596 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:01,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:01,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:01,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:01,737 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 59
[2021-10-11 00:34:01,840 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 59
[2021-10-11 00:34:02,076 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 87
[2021-10-11 00:34:02,297 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 87
[2021-10-11 00:34:02,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,536 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,538 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,540 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,594 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:02,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:02,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,939 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,966 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,969 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:02,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,143 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:03,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:03,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:03,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:03,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:03,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:03,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:03,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,148 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:03,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:03,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,200 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:03,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:34:03,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:03,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:03,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:34:03,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:03,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,437 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:03,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:03,438 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:03,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:03,440 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:03,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:03,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:03,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:03,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:03,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,779 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,812 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,813 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,815 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,817 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,837 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,839 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,841 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,911 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:03,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,268 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92
[2021-10-11 00:34:05,395 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 92
[2021-10-11 00:34:05,522 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 92
[2021-10-11 00:34:05,637 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92
[2021-10-11 00:34:06,133 WARN L197 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124
[2021-10-11 00:34:06,416 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 120
[2021-10-11 00:34:06,971 WARN L197 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124
[2021-10-11 00:34:07,161 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 120
[2021-10-11 00:34:07,184 INFO L131 LiptonReduction]: Checked pairs total: 8591
[2021-10-11 00:34:07,184 INFO L133 LiptonReduction]: Total number of compositions: 92
[2021-10-11 00:34:07,191 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow
[2021-10-11 00:34:07,568 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4874 states.
[2021-10-11 00:34:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states.
[2021-10-11 00:34:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2021-10-11 00:34:07,575 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:07,575 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1]
[2021-10-11 00:34:07,576 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:07,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1211336, now seen corresponding path program 1 times
[2021-10-11 00:34:07,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:07,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223778679]
[2021-10-11 00:34:07,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:07,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223778679]
[2021-10-11 00:34:07,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:07,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:34:07,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009277169]
[2021-10-11 00:34:07,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:34:07,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:34:07,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:34:07,888 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3 states.
[2021-10-11 00:34:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:08,050 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions.
[2021-10-11 00:34:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:34:08,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2021-10-11 00:34:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:08,117 INFO L225 Difference]: With dead ends: 4062
[2021-10-11 00:34:08,118 INFO L226 Difference]: Without dead ends: 3312
[2021-10-11 00:34:08,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:34:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states.
[2021-10-11 00:34:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312.
[2021-10-11 00:34:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states.
[2021-10-11 00:34:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions.
[2021-10-11 00:34:08,378 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3
[2021-10-11 00:34:08,378 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:08,378 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions.
[2021-10-11 00:34:08,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:34:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions.
[2021-10-11 00:34:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-10-11 00:34:08,382 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:08,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:08,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-11 00:34:08,383 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1427630332, now seen corresponding path program 1 times
[2021-10-11 00:34:08,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:08,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057848783]
[2021-10-11 00:34:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:08,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057848783]
[2021-10-11 00:34:08,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:08,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:34:08,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764877701]
[2021-10-11 00:34:08,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:34:08,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:08,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:34:08,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:34:08,547 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states.
[2021-10-11 00:34:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:08,600 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions.
[2021-10-11 00:34:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:34:08,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2021-10-11 00:34:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:08,636 INFO L225 Difference]: With dead ends: 3062
[2021-10-11 00:34:08,637 INFO L226 Difference]: Without dead ends: 3062
[2021-10-11 00:34:08,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:34:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states.
[2021-10-11 00:34:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062.
[2021-10-11 00:34:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states.
[2021-10-11 00:34:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions.
[2021-10-11 00:34:08,827 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 11
[2021-10-11 00:34:08,828 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:08,828 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions.
[2021-10-11 00:34:08,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:34:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions.
[2021-10-11 00:34:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2021-10-11 00:34:08,833 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:08,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:08,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-11 00:34:08,833 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1807776164, now seen corresponding path program 1 times
[2021-10-11 00:34:08,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:08,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144976827]
[2021-10-11 00:34:08,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:08,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144976827]
[2021-10-11 00:34:08,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:08,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:34:08,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280984759]
[2021-10-11 00:34:08,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:34:08,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:34:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:34:08,900 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 3 states.
[2021-10-11 00:34:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:08,944 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions.
[2021-10-11 00:34:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:34:08,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2021-10-11 00:34:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:08,975 INFO L225 Difference]: With dead ends: 3022
[2021-10-11 00:34:08,975 INFO L226 Difference]: Without dead ends: 3022
[2021-10-11 00:34:08,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:34:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states.
[2021-10-11 00:34:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022.
[2021-10-11 00:34:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states.
[2021-10-11 00:34:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions.
[2021-10-11 00:34:09,106 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 13
[2021-10-11 00:34:09,106 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:09,106 INFO L481 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions.
[2021-10-11 00:34:09,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:34:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions.
[2021-10-11 00:34:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2021-10-11 00:34:09,110 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:09,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:09,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-11 00:34:09,110 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1797748092, now seen corresponding path program 1 times
[2021-10-11 00:34:09,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:09,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240711630]
[2021-10-11 00:34:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:09,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240711630]
[2021-10-11 00:34:09,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:09,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:34:09,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811745981]
[2021-10-11 00:34:09,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:34:09,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:09,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:34:09,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:34:09,257 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 4 states.
[2021-10-11 00:34:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:09,338 INFO L93 Difference]: Finished difference Result 2964 states and 10373 transitions.
[2021-10-11 00:34:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:34:09,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2021-10-11 00:34:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:09,360 INFO L225 Difference]: With dead ends: 2964
[2021-10-11 00:34:09,360 INFO L226 Difference]: Without dead ends: 2214
[2021-10-11 00:34:09,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:34:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states.
[2021-10-11 00:34:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2214.
[2021-10-11 00:34:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states.
[2021-10-11 00:34:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 7628 transitions.
[2021-10-11 00:34:09,445 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 7628 transitions. Word has length 14
[2021-10-11 00:34:09,446 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:09,446 INFO L481 AbstractCegarLoop]: Abstraction has 2214 states and 7628 transitions.
[2021-10-11 00:34:09,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:34:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 7628 transitions.
[2021-10-11 00:34:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-10-11 00:34:09,450 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:09,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:09,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-11 00:34:09,450 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1553027137, now seen corresponding path program 1 times
[2021-10-11 00:34:09,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:09,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116718306]
[2021-10-11 00:34:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:09,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116718306]
[2021-10-11 00:34:09,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:09,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:34:09,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106755452]
[2021-10-11 00:34:09,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:34:09,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:09,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:34:09,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:34:09,593 INFO L87 Difference]: Start difference. First operand 2214 states and 7628 transitions. Second operand 4 states.
[2021-10-11 00:34:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:09,713 INFO L93 Difference]: Finished difference Result 3294 states and 11069 transitions.
[2021-10-11 00:34:09,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-11 00:34:09,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2021-10-11 00:34:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:09,735 INFO L225 Difference]: With dead ends: 3294
[2021-10-11 00:34:09,735 INFO L226 Difference]: Without dead ends: 2310
[2021-10-11 00:34:09,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:34:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states.
[2021-10-11 00:34:09,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2178.
[2021-10-11 00:34:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states.
[2021-10-11 00:34:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 7207 transitions.
[2021-10-11 00:34:09,811 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 7207 transitions. Word has length 17
[2021-10-11 00:34:09,812 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:09,812 INFO L481 AbstractCegarLoop]: Abstraction has 2178 states and 7207 transitions.
[2021-10-11 00:34:09,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:34:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 7207 transitions.
[2021-10-11 00:34:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-10-11 00:34:09,816 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:09,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:09,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-11 00:34:09,816 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:09,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:09,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1406896467, now seen corresponding path program 1 times
[2021-10-11 00:34:09,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:09,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854882220]
[2021-10-11 00:34:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:09,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854882220]
[2021-10-11 00:34:09,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:09,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:34:09,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848387391]
[2021-10-11 00:34:09,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:34:09,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:09,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:34:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:34:09,889 INFO L87 Difference]: Start difference. First operand 2178 states and 7207 transitions. Second operand 5 states.
[2021-10-11 00:34:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:09,957 INFO L93 Difference]: Finished difference Result 1832 states and 5586 transitions.
[2021-10-11 00:34:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:34:09,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2021-10-11 00:34:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:09,965 INFO L225 Difference]: With dead ends: 1832
[2021-10-11 00:34:09,965 INFO L226 Difference]: Without dead ends: 1402
[2021-10-11 00:34:09,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:34:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states.
[2021-10-11 00:34:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402.
[2021-10-11 00:34:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states.
[2021-10-11 00:34:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 4197 transitions.
[2021-10-11 00:34:10,009 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 4197 transitions. Word has length 17
[2021-10-11 00:34:10,009 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:10,010 INFO L481 AbstractCegarLoop]: Abstraction has 1402 states and 4197 transitions.
[2021-10-11 00:34:10,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:34:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 4197 transitions.
[2021-10-11 00:34:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-10-11 00:34:10,013 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:10,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:10,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-11 00:34:10,014 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash -116337941, now seen corresponding path program 1 times
[2021-10-11 00:34:10,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:10,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603836474]
[2021-10-11 00:34:10,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:10,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603836474]
[2021-10-11 00:34:10,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:10,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:34:10,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844217867]
[2021-10-11 00:34:10,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:34:10,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:10,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:34:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:34:10,134 INFO L87 Difference]: Start difference. First operand 1402 states and 4197 transitions. Second operand 6 states.
[2021-10-11 00:34:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:10,215 INFO L93 Difference]: Finished difference Result 1239 states and 3682 transitions.
[2021-10-11 00:34:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:34:10,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20
[2021-10-11 00:34:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:10,226 INFO L225 Difference]: With dead ends: 1239
[2021-10-11 00:34:10,226 INFO L226 Difference]: Without dead ends: 1113
[2021-10-11 00:34:10,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:34:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states.
[2021-10-11 00:34:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113.
[2021-10-11 00:34:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states.
[2021-10-11 00:34:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 3354 transitions.
[2021-10-11 00:34:10,267 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 3354 transitions. Word has length 20
[2021-10-11 00:34:10,267 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:10,267 INFO L481 AbstractCegarLoop]: Abstraction has 1113 states and 3354 transitions.
[2021-10-11 00:34:10,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:34:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 3354 transitions.
[2021-10-11 00:34:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2021-10-11 00:34:10,271 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:10,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:10,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-11 00:34:10,271 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1434629232, now seen corresponding path program 1 times
[2021-10-11 00:34:10,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:10,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776287369]
[2021-10-11 00:34:10,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:10,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776287369]
[2021-10-11 00:34:10,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:10,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:34:10,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782949039]
[2021-10-11 00:34:10,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-10-11 00:34:10,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:10,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-11 00:34:10,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:34:10,462 INFO L87 Difference]: Start difference. First operand 1113 states and 3354 transitions. Second operand 7 states.
[2021-10-11 00:34:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:10,737 INFO L93 Difference]: Finished difference Result 1841 states and 5311 transitions.
[2021-10-11 00:34:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:34:10,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2021-10-11 00:34:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:10,743 INFO L225 Difference]: With dead ends: 1841
[2021-10-11 00:34:10,743 INFO L226 Difference]: Without dead ends: 1559
[2021-10-11 00:34:10,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2021-10-11 00:34:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states.
[2021-10-11 00:34:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1344.
[2021-10-11 00:34:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states.
[2021-10-11 00:34:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 3988 transitions.
[2021-10-11 00:34:10,789 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 3988 transitions. Word has length 24
[2021-10-11 00:34:10,790 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:10,790 INFO L481 AbstractCegarLoop]: Abstraction has 1344 states and 3988 transitions.
[2021-10-11 00:34:10,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-10-11 00:34:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 3988 transitions.
[2021-10-11 00:34:10,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2021-10-11 00:34:10,794 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:10,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:10,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-11 00:34:10,794 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:10,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:10,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1258189880, now seen corresponding path program 2 times
[2021-10-11 00:34:10,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:10,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061356965]
[2021-10-11 00:34:10,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:10,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061356965]
[2021-10-11 00:34:10,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:10,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-11 00:34:10,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287552370]
[2021-10-11 00:34:10,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-10-11 00:34:10,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-11 00:34:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:34:10,934 INFO L87 Difference]: Start difference. First operand 1344 states and 3988 transitions. Second operand 7 states.
[2021-10-11 00:34:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:11,019 INFO L93 Difference]: Finished difference Result 1314 states and 3924 transitions.
[2021-10-11 00:34:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-10-11 00:34:11,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2021-10-11 00:34:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:11,023 INFO L225 Difference]: With dead ends: 1314
[2021-10-11 00:34:11,024 INFO L226 Difference]: Without dead ends: 917
[2021-10-11 00:34:11,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2021-10-11 00:34:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states.
[2021-10-11 00:34:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917.
[2021-10-11 00:34:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states.
[2021-10-11 00:34:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 2708 transitions.
[2021-10-11 00:34:11,052 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 2708 transitions. Word has length 24
[2021-10-11 00:34:11,053 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:11,053 INFO L481 AbstractCegarLoop]: Abstraction has 917 states and 2708 transitions.
[2021-10-11 00:34:11,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-10-11 00:34:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 2708 transitions.
[2021-10-11 00:34:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2021-10-11 00:34:11,056 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:11,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:11,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-11 00:34:11,056 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash -513039503, now seen corresponding path program 1 times
[2021-10-11 00:34:11,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:11,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791988903]
[2021-10-11 00:34:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:11,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791988903]
[2021-10-11 00:34:11,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:11,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:34:11,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073849632]
[2021-10-11 00:34:11,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:34:11,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:11,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:34:11,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:34:11,144 INFO L87 Difference]: Start difference. First operand 917 states and 2708 transitions. Second operand 5 states.
[2021-10-11 00:34:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:11,215 INFO L93 Difference]: Finished difference Result 1349 states and 3992 transitions.
[2021-10-11 00:34:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:34:11,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28
[2021-10-11 00:34:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:11,217 INFO L225 Difference]: With dead ends: 1349
[2021-10-11 00:34:11,217 INFO L226 Difference]: Without dead ends: 553
[2021-10-11 00:34:11,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:34:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states.
[2021-10-11 00:34:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 541.
[2021-10-11 00:34:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states.
[2021-10-11 00:34:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1514 transitions.
[2021-10-11 00:34:11,233 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1514 transitions. Word has length 28
[2021-10-11 00:34:11,234 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:11,234 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 1514 transitions.
[2021-10-11 00:34:11,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:34:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1514 transitions.
[2021-10-11 00:34:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2021-10-11 00:34:11,236 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:11,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:11,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-11 00:34:11,236 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:11,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:11,236 INFO L82 PathProgramCache]: Analyzing trace with hash -686546797, now seen corresponding path program 2 times
[2021-10-11 00:34:11,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:11,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43827933]
[2021-10-11 00:34:11,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:11,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:11,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43827933]
[2021-10-11 00:34:11,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:11,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-11 00:34:11,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445948321]
[2021-10-11 00:34:11,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-10-11 00:34:11,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:11,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-11 00:34:11,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-10-11 00:34:11,541 INFO L87 Difference]: Start difference. First operand 541 states and 1514 transitions. Second operand 8 states.
[2021-10-11 00:34:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:11,850 INFO L93 Difference]: Finished difference Result 769 states and 2088 transitions.
[2021-10-11 00:34:11,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-11 00:34:11,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28
[2021-10-11 00:34:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:11,853 INFO L225 Difference]: With dead ends: 769
[2021-10-11 00:34:11,853 INFO L226 Difference]: Without dead ends: 666
[2021-10-11 00:34:11,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2021-10-11 00:34:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states.
[2021-10-11 00:34:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 581.
[2021-10-11 00:34:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states.
[2021-10-11 00:34:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1610 transitions.
[2021-10-11 00:34:11,871 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1610 transitions. Word has length 28
[2021-10-11 00:34:11,871 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:11,871 INFO L481 AbstractCegarLoop]: Abstraction has 581 states and 1610 transitions.
[2021-10-11 00:34:11,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2021-10-11 00:34:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1610 transitions.
[2021-10-11 00:34:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2021-10-11 00:34:11,873 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:11,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:11,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-10-11 00:34:11,874 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1861199413, now seen corresponding path program 3 times
[2021-10-11 00:34:11,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:11,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159041877]
[2021-10-11 00:34:11,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:34:11,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:34:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:34:12,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:34:12,076 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-11 00:34:12,077 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2021-10-11 00:34:12,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-10-11 00:34:12,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:34:12 BasicIcfg
[2021-10-11 00:34:12,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-11 00:34:12,247 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-11 00:34:12,247 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-10-11 00:34:12,247 INFO L275 PluginConnector]: Witness Printer initialized
[2021-10-11 00:34:12,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:56" (3/4) ...
[2021-10-11 00:34:12,250 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-11 00:34:12,406 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc23d29f-cd6d-47f7-9ef3-758596afad87/bin/uautomizer-Z5i5R5N3CC/witness.graphml
[2021-10-11 00:34:12,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-11 00:34:12,407 INFO L168 Benchmark]: Toolchain (without parser) took 19379.21 ms. Allocated memory was 111.1 MB in the beginning and 320.9 MB in the end (delta: 209.7 MB). Free memory was 83.5 MB in the beginning and 152.3 MB in the end (delta: -68.8 MB). Peak memory consumption was 141.5 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:12,407 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 81.8 MB. Free memory was 50.8 MB in the beginning and 50.7 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-11 00:34:12,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.28 ms. Allocated memory is still 111.1 MB. Free memory was 83.5 MB in the beginning and 48.2 MB in the end (delta: 35.3 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:12,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.89 ms. Allocated memory is still 111.1 MB. Free memory was 48.2 MB in the beginning and 45.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:12,408 INFO L168 Benchmark]: Boogie Preprocessor took 42.64 ms. Allocated memory is still 111.1 MB. Free memory was 45.8 MB in the beginning and 43.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:12,409 INFO L168 Benchmark]: RCFGBuilder took 2797.87 ms. Allocated memory was 111.1 MB in the beginning and 146.8 MB in the end (delta: 35.7 MB). Free memory was 43.0 MB in the beginning and 107.5 MB in the end (delta: -64.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:12,409 INFO L168 Benchmark]: TraceAbstraction took 15709.15 ms. Allocated memory was 146.8 MB in the beginning and 320.9 MB in the end (delta: 174.1 MB). Free memory was 106.5 MB in the beginning and 176.4 MB in the end (delta: -69.9 MB). Peak memory consumption was 105.2 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:12,409 INFO L168 Benchmark]: Witness Printer took 159.03 ms. Allocated memory is still 320.9 MB. Free memory was 176.4 MB in the beginning and 152.3 MB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:12,412 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.80 ms. Allocated memory is still 81.8 MB. Free memory was 50.8 MB in the beginning and 50.7 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB.
* CACSL2BoogieTranslator took 608.28 ms. Allocated memory is still 111.1 MB. Free memory was 83.5 MB in the beginning and 48.2 MB in the end (delta: 35.3 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB.
* Boogie Procedure Inliner took 55.89 ms. Allocated memory is still 111.1 MB. Free memory was 48.2 MB in the beginning and 45.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* Boogie Preprocessor took 42.64 ms. Allocated memory is still 111.1 MB. Free memory was 45.8 MB in the beginning and 43.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* RCFGBuilder took 2797.87 ms. Allocated memory was 111.1 MB in the beginning and 146.8 MB in the end (delta: 35.7 MB). Free memory was 43.0 MB in the beginning and 107.5 MB in the end (delta: -64.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.1 GB.
* TraceAbstraction took 15709.15 ms. Allocated memory was 146.8 MB in the beginning and 320.9 MB in the end (delta: 174.1 MB). Free memory was 106.5 MB in the beginning and 176.4 MB in the end (delta: -69.9 MB). Peak memory consumption was 105.2 MB. Max. memory is 16.1 GB.
* Witness Printer took 159.03 ms. Allocated memory is still 320.9 MB. Free memory was 176.4 MB in the beginning and 152.3 MB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1895 VarBasedMoverChecksPositive, 88 VarBasedMoverChecksNegative, 13 SemBasedMoverChecksPositive, 75 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 289 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.4s, 129 PlacesBefore, 47 PlacesAfterwards, 118 TransitionsBefore, 34 TransitionsAfterwards, 2774 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 8591 MoverChecksTotal
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p1_EAX = 0;
[L714] 0 int __unbuffered_p2_EAX = 0;
[L716] 0 int __unbuffered_p3_EAX = 0;
[L718] 0 int __unbuffered_p3_EBX = 0;
[L720] 0 int a = 0;
[L721] 0 _Bool a$flush_delayed;
[L722] 0 int a$mem_tmp;
[L723] 0 _Bool a$r_buff0_thd0;
[L724] 0 _Bool a$r_buff0_thd1;
[L725] 0 _Bool a$r_buff0_thd2;
[L726] 0 _Bool a$r_buff0_thd3;
[L727] 0 _Bool a$r_buff0_thd4;
[L728] 0 _Bool a$r_buff1_thd0;
[L729] 0 _Bool a$r_buff1_thd1;
[L730] 0 _Bool a$r_buff1_thd2;
[L731] 0 _Bool a$r_buff1_thd3;
[L732] 0 _Bool a$r_buff1_thd4;
[L733] 0 _Bool a$read_delayed;
[L734] 0 int *a$read_delayed_var;
[L735] 0 int a$w_buff0;
[L736] 0 _Bool a$w_buff0_used;
[L737] 0 int a$w_buff1;
[L738] 0 _Bool a$w_buff1_used;
[L739] 0 _Bool main$tmp_guard0;
[L740] 0 _Bool main$tmp_guard1;
[L742] 0 int x = 0;
[L744] 0 int y = 0;
[L746] 0 int z = 0;
[L747] 0 _Bool weak$$choice0;
[L748] 0 _Bool weak$$choice2;
[L866] 0 pthread_t t465;
[L867] FCALL, FORK 0 pthread_create(&t465, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L868] 0 pthread_t t466;
[L752] 1 a$w_buff1 = a$w_buff0
[L753] 1 a$w_buff0 = 1
[L754] 1 a$w_buff1_used = a$w_buff0_used
[L755] 1 a$w_buff0_used = (_Bool)1
[L18] COND FALSE 1 !(!expression)
[L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0
[L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1
[L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2
[L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3
[L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4
[L762] 1 a$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L869] FCALL, FORK 0 pthread_create(&t466, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L870] 0 pthread_t t467;
[L871] FCALL, FORK 0 pthread_create(&t467, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L872] 0 pthread_t t468;
[L765] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L782] 2 x = 2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L785] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L802] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a
[L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
[L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
[L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L797] 2 return 0;
[L805] 3 __unbuffered_p2_EAX = z
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a
[L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
[L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
[L873] FCALL, FORK 0 pthread_create(&t468, ((void *)0), P3, ((void *)0))
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0]
[L822] 4 z = 1
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1]
[L825] 4 __unbuffered_p3_EAX = z
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1]
[L828] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L829] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L830] 4 a$flush_delayed = weak$$choice2
[L831] 4 a$mem_tmp = a
[L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)
[L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L834] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)
[L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)
[L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)
[L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)
[L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)
[L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L839] 4 __unbuffered_p3_EBX = a
[L840] EXPR 4 a$flush_delayed ? a$mem_tmp : a
[L840] 4 a = a$flush_delayed ? a$mem_tmp : a
[L841] 4 a$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1]
[L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L844] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a
[L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used
[L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used
[L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used
[L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used
[L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4
[L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4
[L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4
[L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4
[L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
[L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
[L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L777] 1 return 0;
[L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L817] 3 return 0;
[L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L853] 4 return 0;
[L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L3] COND FALSE 0 !(!cond)
[L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L879] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a
[L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
[L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
[L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.8s, HoareTripleCheckerStatistics: 447 SDtfs, 561 SDslu, 923 SDs, 0 SdLazy, 362 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred 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.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 444 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 28901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...