./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_pso.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_80e0b3ef-3fdc-4477-9396-bd78595abf18/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/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_80e0b3ef-3fdc-4477-9396-bd78595abf18/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_pso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/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_80e0b3ef-3fdc-4477-9396-bd78595abf18/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 7baa1d99a6f582f19b6dead0bd8ab50bdc929a26
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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:25:29,193 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-10-11 00:25:29,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-11 00:25:29,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-11 00:25:29,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-11 00:25:29,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-11 00:25:29,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-11 00:25:29,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-11 00:25:29,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-11 00:25:29,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-11 00:25:29,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-10-11 00:25:29,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-11 00:25:29,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-11 00:25:29,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-11 00:25:29,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-11 00:25:29,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-11 00:25:29,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-11 00:25:29,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-11 00:25:29,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-11 00:25:29,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-11 00:25:29,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-11 00:25:29,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-11 00:25:29,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-10-11 00:25:29,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-11 00:25:29,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-11 00:25:29,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-11 00:25:29,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-11 00:25:29,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-11 00:25:29,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-11 00:25:29,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-11 00:25:29,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-11 00:25:29,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-11 00:25:29,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-11 00:25:29,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-11 00:25:29,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-11 00:25:29,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-11 00:25:29,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-11 00:25:29,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-11 00:25:29,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-11 00:25:29,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-11 00:25:29,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-10-11 00:25:29,354 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-11 00:25:29,403 INFO L113 SettingsManager]: Loading preferences was successful
[2021-10-11 00:25:29,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-11 00:25:29,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-11 00:25:29,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-10-11 00:25:29,407 INFO L138 SettingsManager]: * Use SBE=true
[2021-10-11 00:25:29,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-11 00:25:29,407 INFO L138 SettingsManager]: * sizeof long=4
[2021-10-11 00:25:29,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-10-11 00:25:29,409 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-10-11 00:25:29,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-10-11 00:25:29,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-10-11 00:25:29,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-11 00:25:29,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-10-11 00:25:29,412 INFO L138 SettingsManager]: * sizeof long double=12
[2021-10-11 00:25:29,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-10-11 00:25:29,412 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-10-11 00:25:29,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-10-11 00:25:29,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-11 00:25:29,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-10-11 00:25:29,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-10-11 00:25:29,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:25:29,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-11 00:25:29,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-10-11 00:25:29,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-11 00:25:29,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-10-11 00:25:29,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-11 00:25:29,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-11 00:25:29,415 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-10-11 00:25:29,415 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_80e0b3ef-3fdc-4477-9396-bd78595abf18/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_80e0b3ef-3fdc-4477-9396-bd78595abf18/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 -> 7baa1d99a6f582f19b6dead0bd8ab50bdc929a26
[2021-10-11 00:25:29,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-11 00:25:29,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-11 00:25:29,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-11 00:25:29,845 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-10-11 00:25:29,848 INFO L275 PluginConnector]: CDTParser initialized
[2021-10-11 00:25:29,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/mix002_pso.oepc.i
[2021-10-11 00:25:29,932 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/bin/uautomizer-Z5i5R5N3CC/data/c4d6730f6/fbd783dc10e74e51a548a64de8b5819a/FLAG869c308a6
[2021-10-11 00:25:30,702 INFO L306 CDTParser]: Found 1 translation units.
[2021-10-11 00:25:30,703 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/sv-benchmarks/c/pthread-wmm/mix002_pso.oepc.i
[2021-10-11 00:25:30,730 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/bin/uautomizer-Z5i5R5N3CC/data/c4d6730f6/fbd783dc10e74e51a548a64de8b5819a/FLAG869c308a6
[2021-10-11 00:25:30,889 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/bin/uautomizer-Z5i5R5N3CC/data/c4d6730f6/fbd783dc10e74e51a548a64de8b5819a
[2021-10-11 00:25:30,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-11 00:25:30,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-11 00:25:30,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-11 00:25:30,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-11 00:25:30,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-11 00:25:30,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:25:30" (1/1) ...
[2021-10-11 00:25:30,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4978505a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:30, skipping insertion in model container
[2021-10-11 00:25:30,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:25:30" (1/1) ...
[2021-10-11 00:25:30,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-10-11 00:25:30,961 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-10-11 00:25:31,173 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_80e0b3ef-3fdc-4477-9396-bd78595abf18/sv-benchmarks/c/pthread-wmm/mix002_pso.oepc.i[949,962]
[2021-10-11 00:25:31,463 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:25:31,481 INFO L203 MainTranslator]: Completed pre-run
[2021-10-11 00:25:31,506 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_80e0b3ef-3fdc-4477-9396-bd78595abf18/sv-benchmarks/c/pthread-wmm/mix002_pso.oepc.i[949,962]
[2021-10-11 00:25:31,599 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:25:31,680 INFO L208 MainTranslator]: Completed translation
[2021-10-11 00:25:31,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:31 WrapperNode
[2021-10-11 00:25:31,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-11 00:25:31,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-11 00:25:31,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-11 00:25:31,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-11 00:25:31,691 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:25:31" (1/1) ...
[2021-10-11 00:25:31,710 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:25:31" (1/1) ...
[2021-10-11 00:25:31,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-11 00:25:31,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-11 00:25:31,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-11 00:25:31,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-10-11 00:25:31,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:31" (1/1) ...
[2021-10-11 00:25:31,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:31" (1/1) ...
[2021-10-11 00:25:31,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:31" (1/1) ...
[2021-10-11 00:25:31,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:31" (1/1) ...
[2021-10-11 00:25:31,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:31" (1/1) ...
[2021-10-11 00:25:31,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:31" (1/1) ...
[2021-10-11 00:25:31,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:31" (1/1) ...
[2021-10-11 00:25:31,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-11 00:25:31,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-11 00:25:31,820 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-10-11 00:25:31,821 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-10-11 00:25:31,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:31" (1/1) ...
No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/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:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-10-11 00:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-10-11 00:25:31,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-11 00:25:31,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-11 00:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-10-11 00:25:31,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-10-11 00:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-10-11 00:25:31,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-10-11 00:25:31,948 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-10-11 00:25:31,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-10-11 00:25:31,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-11 00:25:31,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-10-11 00:25:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-11 00:25:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-11 00:25:31,982 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:25:34,276 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-11 00:25:34,276 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-10-11 00:25:34,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:25:34 BoogieIcfgContainer
[2021-10-11 00:25:34,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-11 00:25:34,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-11 00:25:34,281 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-10-11 00:25:34,285 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-10-11 00:25:34,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:25:30" (1/3) ...
[2021-10-11 00:25:34,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2212c957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:25:34, skipping insertion in model container
[2021-10-11 00:25:34,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:25:31" (2/3) ...
[2021-10-11 00:25:34,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2212c957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:25:34, skipping insertion in model container
[2021-10-11 00:25:34,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:25:34" (3/3) ...
[2021-10-11 00:25:34,289 INFO L111 eAbstractionObserver]: Analyzing ICFG mix002_pso.oepc.i
[2021-10-11 00:25:34,306 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-10-11 00:25:34,307 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-11 00:25:34,319 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-10-11 00:25:34,320 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-10-11 00:25:34,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,383 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,383 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,383 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,383 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,383 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,384 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,384 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,384 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,390 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,390 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,393 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,394 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,394 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,395 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,395 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,395 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,442 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,442 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,443 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,445 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,445 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,451 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:25:34,458 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-10-11 00:25:34,470 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-10-11 00:25:34,507 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2021-10-11 00:25:34,507 INFO L378 AbstractCegarLoop]: Hoare is true
[2021-10-11 00:25:34,507 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-10-11 00:25:34,507 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-11 00:25:34,507 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-11 00:25:34,507 INFO L382 AbstractCegarLoop]: Difference is false
[2021-10-11 00:25:34,507 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-11 00:25:34,507 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-10-11 00:25:34,521 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-10-11 00:25:34,523 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 229 flow
[2021-10-11 00:25:34,526 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 229 flow
[2021-10-11 00:25:34,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow
[2021-10-11 00:25:34,582 INFO L129 PetriNetUnfolder]: 2/104 cut-off events.
[2021-10-11 00:25:34,582 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-11 00:25:34,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place.
[2021-10-11 00:25:34,591 INFO L116 LiptonReduction]: Number of co-enabled transitions 2076
[2021-10-11 00:25:35,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,018 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:35,030 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:25:35,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:35,126 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,133 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:35,139 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:25:35,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:35,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:35,464 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:25:35,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:35,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:35,538 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:25:35,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:35,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:35,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:35,710 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:35,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:35,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:35,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:35,721 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:25:35,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:35,725 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:25:35,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:35,729 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:25:35,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:35,873 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:35,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:25:35,880 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:35,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:35,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:35,952 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:25:35,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:35,984 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:35,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:35,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:36,001 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:25:36,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:36,124 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:36,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:36,126 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:36,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:36,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:36,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:36,137 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:25:36,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:36,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:36,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:36,175 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:36,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:36,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:36,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:36,183 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:25:36,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:36,640 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-10-11 00:25:36,778 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 57
[2021-10-11 00:25:37,403 WARN L197 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81
[2021-10-11 00:25:37,592 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 79
[2021-10-11 00:25:37,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:37,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:37,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:37,826 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:25:37,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:37,849 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:37,850 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:37,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:37,854 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:25:37,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:37,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:37,923 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:37,926 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:37,928 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:25:37,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:37,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:37,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:37,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:37,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:37,956 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:25:37,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:38,098 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:38,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:25:38,101 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:38,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:38,152 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:38,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:38,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:38,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:38,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:38,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:38,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:38,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:38,163 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:25:38,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:38,164 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:25:38,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:38,165 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:25:38,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:39,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:39,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:39,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:39,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:39,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:39,230 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:25:39,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,233 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:25:39,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,238 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:25:39,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,306 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:39,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:25:39,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:39,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:39,359 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:25:39,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:39,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:39,387 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:25:39,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:39,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term
[2021-10-11 00:25:39,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:39,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:25:39,762 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:39,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,839 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:39,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:39,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:39,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:39,845 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:39,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:39,847 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:25:39,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,848 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:25:39,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,850 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:25:39,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,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:25:39,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:39,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:39,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:39,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:25:39,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:39,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:25:39,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:40,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,135 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,137 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,139 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:25:40,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:40,162 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:25:40,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:40,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,191 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:40,193 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:25:40,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:40,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,211 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,213 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,215 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:25:40,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,352 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48
[2021-10-11 00:25:40,505 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48
[2021-10-11 00:25:40,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:40,565 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:25:40,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:40,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,604 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:25:40,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,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:25:40,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:40,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:25:40,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:40,808 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,809 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,813 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:25:40,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,882 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:40,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:40,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:40,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:40,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:40,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:40,887 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:25:40,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,889 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:25:40,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,890 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:25:40,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:40,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:25:40,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:40,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,969 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,974 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:25:40,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:40,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,991 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:40,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:40,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:40,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:25:40,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:41,109 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:41,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:41,110 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:41,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:41,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:41,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:41,113 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:25:41,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:41,129 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:41,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:41,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:41,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:41,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:41,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:41,134 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:25:41,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:25:41,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:41,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:25:41,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:25:41,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:41,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:25:41,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:25:41,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:41,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:41,231 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:41,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:41,232 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:25:41,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:25:41,234 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:25:41,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:41,235 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:25:41,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:41,237 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:25:41,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:25:42,277 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 65
[2021-10-11 00:25:43,198 WARN L197 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124
[2021-10-11 00:25:43,549 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 120
[2021-10-11 00:25:44,004 WARN L197 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124
[2021-10-11 00:25:44,242 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 120
[2021-10-11 00:25:44,261 INFO L131 LiptonReduction]: Checked pairs total: 6055
[2021-10-11 00:25:44,262 INFO L133 LiptonReduction]: Total number of compositions: 89
[2021-10-11 00:25:44,281 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 29 transitions, 73 flow
[2021-10-11 00:25:44,383 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1360 states.
[2021-10-11 00:25:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states.
[2021-10-11 00:25:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2021-10-11 00:25:44,391 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:44,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1]
[2021-10-11 00:25:44,393 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:44,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1089366, now seen corresponding path program 1 times
[2021-10-11 00:25:44,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:44,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465475135]
[2021-10-11 00:25:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:44,635 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:25:44,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465475135]
[2021-10-11 00:25:44,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:44,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:25:44,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145475338]
[2021-10-11 00:25:44,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:25:44,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:44,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:25:44,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:25:44,691 INFO L87 Difference]: Start difference. First operand 1360 states. Second operand 3 states.
[2021-10-11 00:25:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:44,821 INFO L93 Difference]: Finished difference Result 1166 states and 3780 transitions.
[2021-10-11 00:25:44,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:25:44,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2021-10-11 00:25:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:44,863 INFO L225 Difference]: With dead ends: 1166
[2021-10-11 00:25:44,863 INFO L226 Difference]: Without dead ends: 950
[2021-10-11 00:25:44,864 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:25:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states.
[2021-10-11 00:25:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950.
[2021-10-11 00:25:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states.
[2021-10-11 00:25:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3024 transitions.
[2021-10-11 00:25:44,973 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3024 transitions. Word has length 3
[2021-10-11 00:25:44,973 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:44,974 INFO L481 AbstractCegarLoop]: Abstraction has 950 states and 3024 transitions.
[2021-10-11 00:25:44,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:25:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3024 transitions.
[2021-10-11 00:25:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2021-10-11 00:25:44,975 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:44,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:44,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-11 00:25:44,976 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:44,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1122571753, now seen corresponding path program 1 times
[2021-10-11 00:25:44,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:44,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37756528]
[2021-10-11 00:25:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:45,105 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:25:45,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37756528]
[2021-10-11 00:25:45,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:45,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:25:45,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612972219]
[2021-10-11 00:25:45,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:25:45,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:45,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:25:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:25:45,109 INFO L87 Difference]: Start difference. First operand 950 states and 3024 transitions. Second operand 3 states.
[2021-10-11 00:25:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:45,140 INFO L93 Difference]: Finished difference Result 942 states and 2992 transitions.
[2021-10-11 00:25:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:25:45,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2021-10-11 00:25:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:45,151 INFO L225 Difference]: With dead ends: 942
[2021-10-11 00:25:45,151 INFO L226 Difference]: Without dead ends: 942
[2021-10-11 00:25:45,152 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:25:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states.
[2021-10-11 00:25:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942.
[2021-10-11 00:25:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states.
[2021-10-11 00:25:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2992 transitions.
[2021-10-11 00:25:45,201 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2992 transitions. Word has length 9
[2021-10-11 00:25:45,202 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:45,202 INFO L481 AbstractCegarLoop]: Abstraction has 942 states and 2992 transitions.
[2021-10-11 00:25:45,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:25:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2992 transitions.
[2021-10-11 00:25:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-10-11 00:25:45,207 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:45,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:45,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-11 00:25:45,207 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash -853900116, now seen corresponding path program 1 times
[2021-10-11 00:25:45,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:45,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922267472]
[2021-10-11 00:25:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:45,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922267472]
[2021-10-11 00:25:45,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:45,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:25:45,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032375726]
[2021-10-11 00:25:45,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:25:45,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:45,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:25:45,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:45,352 INFO L87 Difference]: Start difference. First operand 942 states and 2992 transitions. Second operand 4 states.
[2021-10-11 00:25:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:45,389 INFO L93 Difference]: Finished difference Result 878 states and 2760 transitions.
[2021-10-11 00:25:45,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:25:45,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2021-10-11 00:25:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:45,399 INFO L225 Difference]: With dead ends: 878
[2021-10-11 00:25:45,399 INFO L226 Difference]: Without dead ends: 878
[2021-10-11 00:25:45,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states.
[2021-10-11 00:25:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878.
[2021-10-11 00:25:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states.
[2021-10-11 00:25:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 2760 transitions.
[2021-10-11 00:25:45,435 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 2760 transitions. Word has length 11
[2021-10-11 00:25:45,435 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:45,435 INFO L481 AbstractCegarLoop]: Abstraction has 878 states and 2760 transitions.
[2021-10-11 00:25:45,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:25:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 2760 transitions.
[2021-10-11 00:25:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-10-11 00:25:45,442 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:45,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:45,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-11 00:25:45,442 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash -816894998, now seen corresponding path program 1 times
[2021-10-11 00:25:45,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:45,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717525328]
[2021-10-11 00:25:45,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:45,562 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:25:45,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717525328]
[2021-10-11 00:25:45,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:45,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:25:45,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709397244]
[2021-10-11 00:25:45,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:25:45,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:45,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:25:45,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:45,564 INFO L87 Difference]: Start difference. First operand 878 states and 2760 transitions. Second operand 4 states.
[2021-10-11 00:25:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:45,601 INFO L93 Difference]: Finished difference Result 830 states and 2588 transitions.
[2021-10-11 00:25:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:25:45,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2021-10-11 00:25:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:45,610 INFO L225 Difference]: With dead ends: 830
[2021-10-11 00:25:45,610 INFO L226 Difference]: Without dead ends: 830
[2021-10-11 00:25:45,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states.
[2021-10-11 00:25:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830.
[2021-10-11 00:25:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states.
[2021-10-11 00:25:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2588 transitions.
[2021-10-11 00:25:45,640 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2588 transitions. Word has length 11
[2021-10-11 00:25:45,641 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:45,641 INFO L481 AbstractCegarLoop]: Abstraction has 830 states and 2588 transitions.
[2021-10-11 00:25:45,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:25:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2588 transitions.
[2021-10-11 00:25:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2021-10-11 00:25:45,643 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:45,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:45,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-11 00:25:45,643 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:45,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash -321489601, now seen corresponding path program 1 times
[2021-10-11 00:25:45,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:45,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230179198]
[2021-10-11 00:25:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:45,699 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:25:45,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230179198]
[2021-10-11 00:25:45,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:45,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:25:45,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415047444]
[2021-10-11 00:25:45,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:25:45,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:45,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:25:45,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:45,701 INFO L87 Difference]: Start difference. First operand 830 states and 2588 transitions. Second operand 4 states.
[2021-10-11 00:25:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:45,729 INFO L93 Difference]: Finished difference Result 798 states and 2476 transitions.
[2021-10-11 00:25:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:25:45,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2021-10-11 00:25:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:45,736 INFO L225 Difference]: With dead ends: 798
[2021-10-11 00:25:45,737 INFO L226 Difference]: Without dead ends: 798
[2021-10-11 00:25:45,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states.
[2021-10-11 00:25:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798.
[2021-10-11 00:25:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states.
[2021-10-11 00:25:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2476 transitions.
[2021-10-11 00:25:45,765 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2476 transitions. Word has length 13
[2021-10-11 00:25:45,765 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:45,765 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 2476 transitions.
[2021-10-11 00:25:45,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:25:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2476 transitions.
[2021-10-11 00:25:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-11 00:25:45,767 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:45,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:45,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-11 00:25:45,768 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:45,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1102390023, now seen corresponding path program 1 times
[2021-10-11 00:25:45,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:45,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756265955]
[2021-10-11 00:25:45,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:45,818 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:25:45,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756265955]
[2021-10-11 00:25:45,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:45,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:25:45,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477240051]
[2021-10-11 00:25:45,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:25:45,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:45,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:25:45,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:45,820 INFO L87 Difference]: Start difference. First operand 798 states and 2476 transitions. Second operand 4 states.
[2021-10-11 00:25:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:45,853 INFO L93 Difference]: Finished difference Result 737 states and 2033 transitions.
[2021-10-11 00:25:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:25:45,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2021-10-11 00:25:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:45,858 INFO L225 Difference]: With dead ends: 737
[2021-10-11 00:25:45,858 INFO L226 Difference]: Without dead ends: 521
[2021-10-11 00:25:45,859 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:25:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states.
[2021-10-11 00:25:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521.
[2021-10-11 00:25:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states.
[2021-10-11 00:25:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1368 transitions.
[2021-10-11 00:25:45,874 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1368 transitions. Word has length 15
[2021-10-11 00:25:45,875 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:45,875 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 1368 transitions.
[2021-10-11 00:25:45,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:25:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1368 transitions.
[2021-10-11 00:25:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2021-10-11 00:25:45,876 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:45,877 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:45,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-11 00:25:45,877 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:45,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:45,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1391561320, now seen corresponding path program 1 times
[2021-10-11 00:25:45,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:45,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769549850]
[2021-10-11 00:25:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:45,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769549850]
[2021-10-11 00:25:45,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:45,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:25:45,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385361005]
[2021-10-11 00:25:45,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:25:45,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:25:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:25:45,940 INFO L87 Difference]: Start difference. First operand 521 states and 1368 transitions. Second operand 5 states.
[2021-10-11 00:25:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:46,015 INFO L93 Difference]: Finished difference Result 435 states and 1077 transitions.
[2021-10-11 00:25:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:25:46,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2021-10-11 00:25:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:46,019 INFO L225 Difference]: With dead ends: 435
[2021-10-11 00:25:46,019 INFO L226 Difference]: Without dead ends: 344
[2021-10-11 00:25:46,019 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:25:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states.
[2021-10-11 00:25:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344.
[2021-10-11 00:25:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states.
[2021-10-11 00:25:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 837 transitions.
[2021-10-11 00:25:46,031 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 837 transitions. Word has length 18
[2021-10-11 00:25:46,031 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:46,031 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 837 transitions.
[2021-10-11 00:25:46,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:25:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 837 transitions.
[2021-10-11 00:25:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2021-10-11 00:25:46,033 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:46,033 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]
[2021-10-11 00:25:46,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-11 00:25:46,034 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash -292013844, now seen corresponding path program 1 times
[2021-10-11 00:25:46,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:46,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021988978]
[2021-10-11 00:25:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:46,191 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:25:46,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021988978]
[2021-10-11 00:25:46,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:46,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:25:46,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649202553]
[2021-10-11 00:25:46,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:25:46,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:46,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:25:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:25:46,200 INFO L87 Difference]: Start difference. First operand 344 states and 837 transitions. Second operand 6 states.
[2021-10-11 00:25:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:46,263 INFO L93 Difference]: Finished difference Result 321 states and 789 transitions.
[2021-10-11 00:25:46,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:25:46,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21
[2021-10-11 00:25:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:46,266 INFO L225 Difference]: With dead ends: 321
[2021-10-11 00:25:46,267 INFO L226 Difference]: Without dead ends: 305
[2021-10-11 00:25:46,267 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:25:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2021-10-11 00:25:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305.
[2021-10-11 00:25:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states.
[2021-10-11 00:25:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 759 transitions.
[2021-10-11 00:25:46,291 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 759 transitions. Word has length 21
[2021-10-11 00:25:46,291 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:46,292 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 759 transitions.
[2021-10-11 00:25:46,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:25:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 759 transitions.
[2021-10-11 00:25:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2021-10-11 00:25:46,293 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:46,293 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:25:46,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-11 00:25:46,294 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash -224258232, now seen corresponding path program 1 times
[2021-10-11 00:25:46,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:46,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539038158]
[2021-10-11 00:25:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:46,490 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:25:46,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539038158]
[2021-10-11 00:25:46,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:46,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:25:46,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737946489]
[2021-10-11 00:25:46,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-10-11 00:25:46,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:46,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-11 00:25:46,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:25:46,492 INFO L87 Difference]: Start difference. First operand 305 states and 759 transitions. Second operand 7 states.
[2021-10-11 00:25:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:46,653 INFO L93 Difference]: Finished difference Result 458 states and 1090 transitions.
[2021-10-11 00:25:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:25:46,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2021-10-11 00:25:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:46,656 INFO L225 Difference]: With dead ends: 458
[2021-10-11 00:25:46,657 INFO L226 Difference]: Without dead ends: 396
[2021-10-11 00:25:46,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2021-10-11 00:25:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states.
[2021-10-11 00:25:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 305.
[2021-10-11 00:25:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states.
[2021-10-11 00:25:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 741 transitions.
[2021-10-11 00:25:46,666 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 741 transitions. Word has length 24
[2021-10-11 00:25:46,667 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:46,667 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 741 transitions.
[2021-10-11 00:25:46,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-10-11 00:25:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 741 transitions.
[2021-10-11 00:25:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2021-10-11 00:25:46,668 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:46,668 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:25:46,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-11 00:25:46,669 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:46,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2121513664, now seen corresponding path program 2 times
[2021-10-11 00:25:46,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:46,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061436438]
[2021-10-11 00:25:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:25:46,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:25:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:25:46,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:25:46,871 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-11 00:25:46,871 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2021-10-11 00:25:46,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-11 00:25:47,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:25:47 BasicIcfg
[2021-10-11 00:25:47,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-11 00:25:47,072 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-11 00:25:47,072 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-10-11 00:25:47,073 INFO L275 PluginConnector]: Witness Printer initialized
[2021-10-11 00:25:47,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:25:34" (3/4) ...
[2021-10-11 00:25:47,075 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-11 00:25:47,267 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80e0b3ef-3fdc-4477-9396-bd78595abf18/bin/uautomizer-Z5i5R5N3CC/witness.graphml
[2021-10-11 00:25:47,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-11 00:25:47,268 INFO L168 Benchmark]: Toolchain (without parser) took 16374.35 ms. Allocated memory was 98.6 MB in the beginning and 299.9 MB in the end (delta: 201.3 MB). Free memory was 68.7 MB in the beginning and 119.0 MB in the end (delta: -50.4 MB). Peak memory consumption was 149.2 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:47,269 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 81.8 MB. Free memory is still 42.9 MB. There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-11 00:25:47,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.12 ms. Allocated memory is still 98.6 MB. Free memory was 68.4 MB in the beginning and 52.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:47,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.59 ms. Allocated memory is still 98.6 MB. Free memory was 52.3 MB in the beginning and 49.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:47,270 INFO L168 Benchmark]: Boogie Preprocessor took 76.59 ms. Allocated memory is still 98.6 MB. Free memory was 49.8 MB in the beginning and 47.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:47,271 INFO L168 Benchmark]: RCFGBuilder took 2459.04 ms. Allocated memory was 98.6 MB in the beginning and 138.4 MB in the end (delta: 39.8 MB). Free memory was 47.7 MB in the beginning and 106.9 MB in the end (delta: -59.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:47,271 INFO L168 Benchmark]: TraceAbstraction took 12790.74 ms. Allocated memory was 138.4 MB in the beginning and 299.9 MB in the end (delta: 161.5 MB). Free memory was 106.9 MB in the beginning and 137.9 MB in the end (delta: -31.0 MB). Peak memory consumption was 129.5 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:47,274 INFO L168 Benchmark]: Witness Printer took 195.12 ms. Allocated memory is still 299.9 MB. Free memory was 137.9 MB in the beginning and 119.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:47,277 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.66 ms. Allocated memory is still 81.8 MB. Free memory is still 42.9 MB. There was no memory consumed. Max. memory is 16.1 GB.
* CACSL2BoogieTranslator took 786.12 ms. Allocated memory is still 98.6 MB. Free memory was 68.4 MB in the beginning and 52.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB.
* Boogie Procedure Inliner took 59.59 ms. Allocated memory is still 98.6 MB. Free memory was 52.3 MB in the beginning and 49.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* Boogie Preprocessor took 76.59 ms. Allocated memory is still 98.6 MB. Free memory was 49.8 MB in the beginning and 47.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* RCFGBuilder took 2459.04 ms. Allocated memory was 98.6 MB in the beginning and 138.4 MB in the end (delta: 39.8 MB). Free memory was 47.7 MB in the beginning and 106.9 MB in the end (delta: -59.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 16.1 GB.
* TraceAbstraction took 12790.74 ms. Allocated memory was 138.4 MB in the beginning and 299.9 MB in the end (delta: 161.5 MB). Free memory was 106.9 MB in the beginning and 137.9 MB in the end (delta: -31.0 MB). Peak memory consumption was 129.5 MB. Max. memory is 16.1 GB.
* Witness Printer took 195.12 ms. Allocated memory is still 299.9 MB. Free memory was 137.9 MB in the beginning and 119.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1557 VarBasedMoverChecksPositive, 79 VarBasedMoverChecksNegative, 10 SemBasedMoverChecksPositive, 69 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.8s, 222 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.7s, 115 PlacesBefore, 39 PlacesAfterwards, 107 TransitionsBefore, 29 TransitionsAfterwards, 2076 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 6055 MoverChecksTotal
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p0_EBX = 0;
[L715] 0 int __unbuffered_p1_EAX = 0;
[L717] 0 int __unbuffered_p1_EBX = 0;
[L719] 0 int __unbuffered_p2_EAX = 0;
[L721] 0 int __unbuffered_p2_EBX = 0;
[L723] 0 int a = 0;
[L724] 0 _Bool a$flush_delayed;
[L725] 0 int a$mem_tmp;
[L726] 0 _Bool a$r_buff0_thd0;
[L727] 0 _Bool a$r_buff0_thd1;
[L728] 0 _Bool a$r_buff0_thd2;
[L729] 0 _Bool a$r_buff0_thd3;
[L730] 0 _Bool a$r_buff1_thd0;
[L731] 0 _Bool a$r_buff1_thd1;
[L732] 0 _Bool a$r_buff1_thd2;
[L733] 0 _Bool a$r_buff1_thd3;
[L734] 0 _Bool a$read_delayed;
[L735] 0 int *a$read_delayed_var;
[L736] 0 int a$w_buff0;
[L737] 0 _Bool a$w_buff0_used;
[L738] 0 int a$w_buff1;
[L739] 0 _Bool a$w_buff1_used;
[L740] 0 _Bool main$tmp_guard0;
[L741] 0 _Bool main$tmp_guard1;
[L743] 0 int x = 0;
[L745] 0 int y = 0;
[L747] 0 int z = 0;
[L748] 0 _Bool weak$$choice0;
[L749] 0 _Bool weak$$choice2;
[L855] 0 pthread_t t44;
[L856] FCALL, FORK 0 pthread_create(&t44, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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]
[L857] 0 pthread_t t45;
[L858] FCALL, FORK 0 pthread_create(&t45, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L753] 1 a$w_buff1 = a$w_buff0
[L754] 1 a$w_buff0 = 1
[L755] 1 a$w_buff1_used = a$w_buff0_used
[L756] 1 a$w_buff0_used = (_Bool)1
[L18] COND FALSE 1 !(!expression)
[L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0
[L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1
[L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2
[L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3
[L762] 1 a$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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]
[L765] 1 x = 1
[L768] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0]
[L771] 1 __unbuffered_p0_EBX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0]
[L788] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=0]
[L791] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=0]
[L794] 2 __unbuffered_p1_EBX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=0]
[L797] 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)
[L797] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a
[L797] 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)
[L797] 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)
[L798] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L799] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L799] 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
[L800] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L801] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
[L801] 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
[L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L806] 2 return 0;
[L859] 0 pthread_t t46;
[L860] FCALL, FORK 0 pthread_create(&t46, ((void *)0), P2, ((void *)0))
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=0]
[L811] 3 z = 1
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1]
[L814] 3 __unbuffered_p2_EAX = z
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1]
[L817] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L818] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L819] 3 a$flush_delayed = weak$$choice2
[L820] 3 a$mem_tmp = a
[L821] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)
[L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)
[L822] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))
[L822] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)
[L822] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))
[L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))
[L823] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))
[L823] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)
[L823] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))
[L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))
[L824] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))
[L824] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)
[L824] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))
[L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))
[L825] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L825] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L825] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3))
[L826] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)
[L826] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3))
[L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3))
[L827] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L827] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L827] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L828] 3 __unbuffered_p2_EBX = a
[L829] EXPR 3 a$flush_delayed ? a$mem_tmp : a
[L829] 3 a = a$flush_delayed ? a$mem_tmp : a
[L830] 3 a$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=49, weak$$choice2=0, x=1, y=1, z=1]
[L774] 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)
[L774] 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)
[L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L776] 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
[L777] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L778] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
[L778] 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
[L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L783] 1 return 0;
[L833] 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)
[L833] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a
[L833] 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)
[L833] 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)
[L834] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L835] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L835] 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
[L836] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L837] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
[L837] 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
[L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L842] 3 return 0;
[L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L3] COND FALSE 0 !(!cond)
[L866] 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)
[L866] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a
[L866] 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)
[L866] 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)
[L867] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L868] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L868] 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
[L869] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
[L870] 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
[L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.3s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.8s, HoareTripleCheckerStatistics: 262 SDtfs, 280 SDslu, 455 SDs, 0 SdLazy, 182 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1360occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 91 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 13338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...