./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_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_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/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_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/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_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/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 0146bae3b0811753bd98ed574df95389b28824e7
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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:22:41,080 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-10-11 00:22:41,082 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-11 00:22:41,139 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-11 00:22:41,140 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-11 00:22:41,141 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-11 00:22:41,143 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-11 00:22:41,145 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-11 00:22:41,148 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-11 00:22:41,149 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-11 00:22:41,150 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-10-11 00:22:41,152 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-11 00:22:41,152 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-11 00:22:41,154 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-11 00:22:41,155 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-11 00:22:41,156 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-11 00:22:41,158 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-11 00:22:41,159 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-11 00:22:41,161 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-11 00:22:41,163 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-11 00:22:41,165 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-11 00:22:41,167 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-11 00:22:41,168 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-10-11 00:22:41,170 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-11 00:22:41,173 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-11 00:22:41,173 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-11 00:22:41,174 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-11 00:22:41,175 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-11 00:22:41,176 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-11 00:22:41,177 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-11 00:22:41,177 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-11 00:22:41,178 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-11 00:22:41,179 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-11 00:22:41,180 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-11 00:22:41,182 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-11 00:22:41,182 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-11 00:22:41,183 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-11 00:22:41,184 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-11 00:22:41,184 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-11 00:22:41,185 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-11 00:22:41,186 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-10-11 00:22:41,187 INFO  L101        SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-11 00:22:41,211 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-10-11 00:22:41,211 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-11 00:22:41,213 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-11 00:22:41,213 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-10-11 00:22:41,213 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-10-11 00:22:41,213 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-11 00:22:41,214 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-10-11 00:22:41,214 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-10-11 00:22:41,214 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-10-11 00:22:41,214 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-10-11 00:22:41,215 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-10-11 00:22:41,215 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-11 00:22:41,215 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-10-11 00:22:41,215 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-10-11 00:22:41,216 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-10-11 00:22:41,216 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-10-11 00:22:41,216 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-10-11 00:22:41,217 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-11 00:22:41,217 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-10-11 00:22:41,217 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-10-11 00:22:41,217 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:22:41,218 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-11 00:22:41,218 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-10-11 00:22:41,218 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-11 00:22:41,218 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-10-11 00:22:41,219 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-11 00:22:41,219 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-11 00:22:41,219 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-10-11 00:22:41,219 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_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/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_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/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 -> 0146bae3b0811753bd98ed574df95389b28824e7
[2021-10-11 00:22:41,461 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-11 00:22:41,492 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-11 00:22:41,496 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-11 00:22:41,498 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-10-11 00:22:41,499 INFO  L275        PluginConnector]: CDTParser initialized
[2021-10-11 00:22:41,500 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i
[2021-10-11 00:22:41,566 INFO  L220              CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/bin/uautomizer-Z5i5R5N3CC/data/f88eef6cd/254a61efebf840dbb35c9e7719005a75/FLAGfb4114082
[2021-10-11 00:22:42,119 INFO  L306              CDTParser]: Found 1 translation units.
[2021-10-11 00:22:42,120 INFO  L160              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i
[2021-10-11 00:22:42,138 INFO  L349              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/bin/uautomizer-Z5i5R5N3CC/data/f88eef6cd/254a61efebf840dbb35c9e7719005a75/FLAGfb4114082
[2021-10-11 00:22:42,395 INFO  L357              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/bin/uautomizer-Z5i5R5N3CC/data/f88eef6cd/254a61efebf840dbb35c9e7719005a75
[2021-10-11 00:22:42,398 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-11 00:22:42,400 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-11 00:22:42,403 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-11 00:22:42,404 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-11 00:22:42,408 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-11 00:22:42,408 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:22:42" (1/1) ...
[2021-10-11 00:22:42,415 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e41968a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:42, skipping insertion in model container
[2021-10-11 00:22:42,415 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:22:42" (1/1) ...
[2021-10-11 00:22:42,424 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-10-11 00:22:42,499 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-10-11 00:22:42,747 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_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i[949,962]
[2021-10-11 00:22:42,998 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:22:43,015 INFO  L203         MainTranslator]: Completed pre-run
[2021-10-11 00:22:43,030 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_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/sv-benchmarks/c/pthread-wmm/mix041_pso.oepc.i[949,962]
[2021-10-11 00:22:43,098 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:22:43,185 INFO  L208         MainTranslator]: Completed translation
[2021-10-11 00:22:43,185 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:43 WrapperNode
[2021-10-11 00:22:43,186 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-11 00:22:43,187 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-11 00:22:43,187 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-11 00:22:43,187 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-11 00:22:43,195 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:22:43" (1/1) ...
[2021-10-11 00:22:43,213 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:22:43" (1/1) ...
[2021-10-11 00:22:43,239 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-11 00:22:43,240 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-11 00:22:43,240 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-11 00:22:43,240 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-10-11 00:22:43,249 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:43" (1/1) ...
[2021-10-11 00:22:43,249 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:43" (1/1) ...
[2021-10-11 00:22:43,255 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:43" (1/1) ...
[2021-10-11 00:22:43,255 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:43" (1/1) ...
[2021-10-11 00:22:43,268 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:43" (1/1) ...
[2021-10-11 00:22:43,273 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:43" (1/1) ...
[2021-10-11 00:22:43,277 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:43" (1/1) ...
[2021-10-11 00:22:43,282 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-11 00:22:43,283 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-11 00:22:43,283 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-10-11 00:22:43,283 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-10-11 00:22:43,284 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:43" (1/1) ...
No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/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:22:43,381 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-10-11 00:22:43,381 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-10-11 00:22:43,381 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-11 00:22:43,382 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-11 00:22:43,382 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-10-11 00:22:43,382 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-10-11 00:22:43,382 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-10-11 00:22:43,382 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-10-11 00:22:43,383 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-11 00:22:43,384 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-10-11 00:22:43,384 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-11 00:22:43,384 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-11 00:22:43,386 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:22:45,531 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-11 00:22:45,531 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-10-11 00:22:45,534 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:45 BoogieIcfgContainer
[2021-10-11 00:22:45,534 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-11 00:22:45,538 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-11 00:22:45,538 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-10-11 00:22:45,542 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-10-11 00:22:45,542 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:22:42" (1/3) ...
[2021-10-11 00:22:45,543 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626fe8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:22:45, skipping insertion in model container
[2021-10-11 00:22:45,543 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:43" (2/3) ...
[2021-10-11 00:22:45,544 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626fe8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:22:45, skipping insertion in model container
[2021-10-11 00:22:45,544 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:45" (3/3) ...
[2021-10-11 00:22:45,547 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc.i
[2021-10-11 00:22:45,564 WARN  L169   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-10-11 00:22:45,565 INFO  L180   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-11 00:22:45,568 INFO  L192   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-10-11 00:22:45,569 INFO  L354   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-10-11 00:22:45,617 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,618 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,618 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,618 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,618 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,618 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,619 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,619 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,619 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,620 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,620 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,620 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,621 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,621 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,621 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,621 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,622 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,622 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,622 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,622 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,623 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,623 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,623 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,624 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,624 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,624 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,624 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,625 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,626 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,626 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,626 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,627 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,627 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,627 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,628 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,628 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,629 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,629 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,630 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,630 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,630 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,630 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,631 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,631 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,631 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,631 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,632 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,632 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,632 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,632 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,632 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,632 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,633 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,633 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,633 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,633 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,633 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,634 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,634 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,634 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,634 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,634 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,635 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,635 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,635 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,635 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,636 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,636 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,636 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,636 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,636 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,636 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,637 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,637 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,637 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,637 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,637 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,638 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,638 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,638 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,640 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,640 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,640 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,640 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,641 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,641 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,642 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,642 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,642 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,642 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,642 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,643 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,643 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,644 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,646 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,647 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,647 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,647 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,647 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,647 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,647 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,648 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,648 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,649 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,649 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,649 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,655 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,655 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,656 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,656 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,656 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,656 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,656 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,656 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,656 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,657 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,657 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,657 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,659 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,659 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,660 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,660 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,660 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,660 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,660 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,661 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,661 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,661 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,661 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,662 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,662 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,662 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,664 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,664 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,664 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,664 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,666 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,667 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,667 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,667 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,667 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,667 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,667 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,668 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,668 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,668 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,668 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,669 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,671 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,672 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,672 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,672 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,672 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,672 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,673 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,673 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,673 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,673 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,673 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,674 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,674 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,674 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,674 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,675 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,675 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,675 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,676 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,676 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,676 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,676 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,683 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,684 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,684 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,684 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,684 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,685 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,685 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,685 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,685 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,685 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,685 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:22:45,688 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-10-11 00:22:45,699 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2021-10-11 00:22:45,733 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2021-10-11 00:22:45,733 INFO  L378      AbstractCegarLoop]: Hoare is true
[2021-10-11 00:22:45,733 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-10-11 00:22:45,733 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-11 00:22:45,734 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-11 00:22:45,734 INFO  L382      AbstractCegarLoop]: Difference is false
[2021-10-11 00:22:45,734 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-11 00:22:45,734 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-10-11 00:22:45,749 INFO  L120   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-10-11 00:22:45,751 INFO  L135   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 178 flow
[2021-10-11 00:22:45,754 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 178 flow
[2021-10-11 00:22:45,756 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow
[2021-10-11 00:22:45,799 INFO  L129       PetriNetUnfolder]: 2/82 cut-off events.
[2021-10-11 00:22:45,800 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-11 00:22:45,803 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. 
[2021-10-11 00:22:45,808 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1058
[2021-10-11 00:22:46,299 WARN  L197               SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-10-11 00:22:46,403 WARN  L197               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 57
[2021-10-11 00:22:46,984 WARN  L197               SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81
[2021-10-11 00:22:47,190 WARN  L197               SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 79
[2021-10-11 00:22:47,296 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,297 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:47,300 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,300 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:47,309 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,310 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:47,323 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:22:47,323 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:47,369 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,370 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:47,371 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,372 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:47,375 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,375 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:47,378 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:22:47,379 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:47,880 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,882 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:47,886 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,887 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:47,892 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,893 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:47,897 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:22:47,897 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:47,942 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,942 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:47,944 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,945 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:47,947 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:47,948 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:47,955 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:22:47,955 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,473 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,473 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,474 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,474 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,477 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,477 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,480 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:22:48,480 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,505 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,506 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,506 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,507 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,509 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,509 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,512 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:22:48,512 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,549 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,549 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,550 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,551 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,553 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,553 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,556 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:22:48,556 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,578 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,578 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,579 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,579 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,581 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,581 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,584 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:22:48,584 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,847 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term
[2021-10-11 00:22:48,848 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:48,849 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term
[2021-10-11 00:22:48,849 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:48,850 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term
[2021-10-11 00:22:48,851 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:48,927 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,927 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,947 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,947 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,949 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,950 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,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:22:48,952 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:48,973 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,974 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,975 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,975 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:48,977 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:48,977 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:48,980 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:22:48,980 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:49,109 WARN  L197               SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 59
[2021-10-11 00:22:49,219 WARN  L197               SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 59
[2021-10-11 00:22:49,418 WARN  L197               SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-10-11 00:22:49,609 WARN  L197               SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-10-11 00:22:49,823 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:22:49,823 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:22:49,826 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:22:49,827 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:49,908 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:49,908 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:49,910 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:49,911 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:49,912 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:49,913 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:49,914 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:49,914 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:49,916 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:22:49,916 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:49,918 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:22:49,919 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:49,920 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:22:49,920 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,375 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,376 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,390 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:50,391 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:50,393 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:50,393 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:50,394 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:50,394 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:50,396 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:22:50,396 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,398 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:22:50,399 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,400 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:22:50,400 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,450 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:22:50,451 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:22:50,453 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:22:50,453 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,484 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,484 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,485 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,485 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,487 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,487 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,489 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:22:50,489 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,509 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,509 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,510 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,510 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,533 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,534 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:50,536 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:22:50,537 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:50,593 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,594 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,602 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:50,603 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:50,605 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:50,605 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:50,607 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:50,607 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:50,609 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:22:50,610 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,611 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:22:50,612 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,613 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:22:50,613 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,674 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:22:50,675 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:22:50,678 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:22:50,678 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,747 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:22:50,748 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:22:50,750 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:22:50,750 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,797 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,797 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,799 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:50,799 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:50,801 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:50,801 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:50,802 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:22:50,802 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:22:50,805 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:22:50,805 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,807 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:22:50,807 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,808 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:22:50,809 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,955 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,955 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,956 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,957 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,958 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,959 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,960 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:22:50,961 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:50,981 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,982 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,982 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,983 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:50,985 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:50,985 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:50,987 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:22:50,988 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:51,033 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:51,034 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:51,034 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:51,035 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:51,036 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:51,037 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:51,039 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:22:51,039 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:22:51,058 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:51,058 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:51,059 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:51,059 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:51,062 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:22:51,062 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:51,064 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:22:51,065 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:22:51,139 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2021-10-11 00:22:51,140 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:51,522 WARN  L197               SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47
[2021-10-11 00:22:51,672 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2021-10-11 00:22:51,673 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:22:53,151 WARN  L197               SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105
[2021-10-11 00:22:53,331 WARN  L197               SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 101
[2021-10-11 00:22:53,614 WARN  L197               SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105
[2021-10-11 00:22:53,753 WARN  L197               SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 101
[2021-10-11 00:22:53,937 WARN  L197               SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2021-10-11 00:22:54,113 WARN  L197               SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2021-10-11 00:22:54,289 WARN  L197               SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2021-10-11 00:22:54,450 WARN  L197               SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2021-10-11 00:22:54,454 INFO  L131        LiptonReduction]: Checked pairs total: 2912
[2021-10-11 00:22:54,454 INFO  L133        LiptonReduction]: Total number of compositions: 73
[2021-10-11 00:22:54,460 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow
[2021-10-11 00:22:54,479 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 230 states.
[2021-10-11 00:22:54,481 INFO  L276                IsEmpty]: Start isEmpty. Operand 230 states.
[2021-10-11 00:22:54,485 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2021-10-11 00:22:54,485 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:22:54,486 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2021-10-11 00:22:54,486 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:22:54,491 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:22:54,491 INFO  L82        PathProgramCache]: Analyzing trace with hash 926081, now seen corresponding path program 1 times
[2021-10-11 00:22:54,499 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:22:54,500 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356290595]
[2021-10-11 00:22:54,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:22:54,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:22:54,738 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:22:54,739 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356290595]
[2021-10-11 00:22:54,739 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:22:54,739 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:22:54,740 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558430483]
[2021-10-11 00:22:54,744 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:22:54,744 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:22:54,757 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:22:54,758 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:22:54,760 INFO  L87              Difference]: Start difference. First operand 230 states. Second operand 3 states.
[2021-10-11 00:22:54,830 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:22:54,831 INFO  L93              Difference]: Finished difference Result 192 states and 464 transitions.
[2021-10-11 00:22:54,831 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-11 00:22:54,833 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2021-10-11 00:22:54,833 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:22:54,850 INFO  L225             Difference]: With dead ends: 192
[2021-10-11 00:22:54,851 INFO  L226             Difference]: Without dead ends: 162
[2021-10-11 00:22:54,852 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:22:54,871 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2021-10-11 00:22:54,915 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162.
[2021-10-11 00:22:54,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 162 states.
[2021-10-11 00:22:54,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions.
[2021-10-11 00:22:54,927 INFO  L78                 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 3
[2021-10-11 00:22:54,928 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:22:54,928 INFO  L481      AbstractCegarLoop]: Abstraction has 162 states and 385 transitions.
[2021-10-11 00:22:54,928 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:22:54,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions.
[2021-10-11 00:22:54,929 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2021-10-11 00:22:54,929 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:22:54,929 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:22:54,929 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-11 00:22:54,930 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:22:54,932 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:22:54,933 INFO  L82        PathProgramCache]: Analyzing trace with hash 1561917711, now seen corresponding path program 1 times
[2021-10-11 00:22:54,933 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:22:54,933 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632475898]
[2021-10-11 00:22:54,933 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:22:55,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:22:55,111 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:22:55,111 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632475898]
[2021-10-11 00:22:55,111 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:22:55,111 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:22:55,111 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097382789]
[2021-10-11 00:22:55,112 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:22:55,112 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:22:55,113 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:22:55,113 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:22:55,113 INFO  L87              Difference]: Start difference. First operand 162 states and 385 transitions. Second operand 4 states.
[2021-10-11 00:22:55,184 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:22:55,184 INFO  L93              Difference]: Finished difference Result 272 states and 603 transitions.
[2021-10-11 00:22:55,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-11 00:22:55,187 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2021-10-11 00:22:55,187 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:22:55,190 INFO  L225             Difference]: With dead ends: 272
[2021-10-11 00:22:55,190 INFO  L226             Difference]: Without dead ends: 200
[2021-10-11 00:22:55,191 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:22:55,192 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 200 states.
[2021-10-11 00:22:55,214 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 170.
[2021-10-11 00:22:55,214 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 170 states.
[2021-10-11 00:22:55,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 390 transitions.
[2021-10-11 00:22:55,215 INFO  L78                 Accepts]: Start accepts. Automaton has 170 states and 390 transitions. Word has length 8
[2021-10-11 00:22:55,215 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:22:55,215 INFO  L481      AbstractCegarLoop]: Abstraction has 170 states and 390 transitions.
[2021-10-11 00:22:55,215 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:22:55,216 INFO  L276                IsEmpty]: Start isEmpty. Operand 170 states and 390 transitions.
[2021-10-11 00:22:55,217 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2021-10-11 00:22:55,217 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:22:55,217 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:22:55,218 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-11 00:22:55,218 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:22:55,218 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:22:55,218 INFO  L82        PathProgramCache]: Analyzing trace with hash 1174832401, now seen corresponding path program 1 times
[2021-10-11 00:22:55,218 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:22:55,219 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245882947]
[2021-10-11 00:22:55,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:22:55,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:22:55,359 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:22:55,359 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245882947]
[2021-10-11 00:22:55,359 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:22:55,359 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:22:55,359 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611202917]
[2021-10-11 00:22:55,360 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:22:55,360 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:22:55,360 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:22:55,360 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:22:55,361 INFO  L87              Difference]: Start difference. First operand 170 states and 390 transitions. Second operand 4 states.
[2021-10-11 00:22:55,380 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:22:55,380 INFO  L93              Difference]: Finished difference Result 185 states and 407 transitions.
[2021-10-11 00:22:55,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-11 00:22:55,381 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 9
[2021-10-11 00:22:55,381 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:22:55,382 INFO  L225             Difference]: With dead ends: 185
[2021-10-11 00:22:55,383 INFO  L226             Difference]: Without dead ends: 160
[2021-10-11 00:22:55,383 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:22:55,384 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2021-10-11 00:22:55,391 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151.
[2021-10-11 00:22:55,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 151 states.
[2021-10-11 00:22:55,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 341 transitions.
[2021-10-11 00:22:55,392 INFO  L78                 Accepts]: Start accepts. Automaton has 151 states and 341 transitions. Word has length 9
[2021-10-11 00:22:55,393 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:22:55,393 INFO  L481      AbstractCegarLoop]: Abstraction has 151 states and 341 transitions.
[2021-10-11 00:22:55,393 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:22:55,393 INFO  L276                IsEmpty]: Start isEmpty. Operand 151 states and 341 transitions.
[2021-10-11 00:22:55,394 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2021-10-11 00:22:55,394 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:22:55,394 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:22:55,395 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-11 00:22:55,395 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:22:55,395 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:22:55,395 INFO  L82        PathProgramCache]: Analyzing trace with hash 2060038746, now seen corresponding path program 1 times
[2021-10-11 00:22:55,395 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:22:55,396 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517638723]
[2021-10-11 00:22:55,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:22:55,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:22:55,481 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:22:55,482 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517638723]
[2021-10-11 00:22:55,482 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:22:55,482 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:22:55,482 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071924661]
[2021-10-11 00:22:55,483 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:22:55,483 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:22:55,483 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:22:55,484 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:22:55,484 INFO  L87              Difference]: Start difference. First operand 151 states and 341 transitions. Second operand 4 states.
[2021-10-11 00:22:55,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:22:55,517 INFO  L93              Difference]: Finished difference Result 116 states and 214 transitions.
[2021-10-11 00:22:55,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-11 00:22:55,518 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2021-10-11 00:22:55,518 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:22:55,519 INFO  L225             Difference]: With dead ends: 116
[2021-10-11 00:22:55,519 INFO  L226             Difference]: Without dead ends: 83
[2021-10-11 00:22:55,520 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:22:55,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2021-10-11 00:22:55,530 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2021-10-11 00:22:55,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2021-10-11 00:22:55,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 141 transitions.
[2021-10-11 00:22:55,531 INFO  L78                 Accepts]: Start accepts. Automaton has 83 states and 141 transitions. Word has length 10
[2021-10-11 00:22:55,531 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:22:55,531 INFO  L481      AbstractCegarLoop]: Abstraction has 83 states and 141 transitions.
[2021-10-11 00:22:55,531 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:22:55,531 INFO  L276                IsEmpty]: Start isEmpty. Operand 83 states and 141 transitions.
[2021-10-11 00:22:55,536 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2021-10-11 00:22:55,536 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:22:55,536 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:22:55,537 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-11 00:22:55,537 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:22:55,537 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:22:55,537 INFO  L82        PathProgramCache]: Analyzing trace with hash 1923758784, now seen corresponding path program 1 times
[2021-10-11 00:22:55,538 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:22:55,538 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970287190]
[2021-10-11 00:22:55,538 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:22:55,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:22:55,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:22:55,708 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970287190]
[2021-10-11 00:22:55,708 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:22:55,708 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:22:55,708 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862306374]
[2021-10-11 00:22:55,709 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:22:55,709 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:22:55,709 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:22:55,710 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:22:55,710 INFO  L87              Difference]: Start difference. First operand 83 states and 141 transitions. Second operand 5 states.
[2021-10-11 00:22:55,747 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:22:55,747 INFO  L93              Difference]: Finished difference Result 60 states and 94 transitions.
[2021-10-11 00:22:55,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-10-11 00:22:55,748 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2021-10-11 00:22:55,748 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:22:55,748 INFO  L225             Difference]: With dead ends: 60
[2021-10-11 00:22:55,749 INFO  L226             Difference]: Without dead ends: 43
[2021-10-11 00:22:55,749 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:22:55,749 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2021-10-11 00:22:55,751 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40.
[2021-10-11 00:22:55,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2021-10-11 00:22:55,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions.
[2021-10-11 00:22:55,751 INFO  L78                 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 13
[2021-10-11 00:22:55,752 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:22:55,752 INFO  L481      AbstractCegarLoop]: Abstraction has 40 states and 61 transitions.
[2021-10-11 00:22:55,752 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:22:55,752 INFO  L276                IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions.
[2021-10-11 00:22:55,753 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-10-11 00:22:55,753 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:22:55,753 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:22:55,753 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-11 00:22:55,753 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:22:55,754 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:22:55,754 INFO  L82        PathProgramCache]: Analyzing trace with hash 923227579, now seen corresponding path program 1 times
[2021-10-11 00:22:55,754 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:22:55,754 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445468974]
[2021-10-11 00:22:55,754 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:22:55,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:22:55,940 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:22:55,940 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445468974]
[2021-10-11 00:22:55,941 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:22:55,941 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:22:55,941 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78213318]
[2021-10-11 00:22:55,941 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:22:55,941 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:22:55,942 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:22:55,942 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:22:55,942 INFO  L87              Difference]: Start difference. First operand 40 states and 61 transitions. Second operand 5 states.
[2021-10-11 00:22:56,008 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:22:56,008 INFO  L93              Difference]: Finished difference Result 58 states and 86 transitions.
[2021-10-11 00:22:56,009 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-11 00:22:56,009 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2021-10-11 00:22:56,009 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:22:56,009 INFO  L225             Difference]: With dead ends: 58
[2021-10-11 00:22:56,009 INFO  L226             Difference]: Without dead ends: 36
[2021-10-11 00:22:56,010 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:22:56,010 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2021-10-11 00:22:56,011 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2021-10-11 00:22:56,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2021-10-11 00:22:56,011 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions.
[2021-10-11 00:22:56,012 INFO  L78                 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 17
[2021-10-11 00:22:56,012 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:22:56,012 INFO  L481      AbstractCegarLoop]: Abstraction has 36 states and 53 transitions.
[2021-10-11 00:22:56,012 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:22:56,012 INFO  L276                IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions.
[2021-10-11 00:22:56,012 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-10-11 00:22:56,013 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:22:56,013 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:22:56,013 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-11 00:22:56,013 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:22:56,013 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:22:56,013 INFO  L82        PathProgramCache]: Analyzing trace with hash 1064330181, now seen corresponding path program 2 times
[2021-10-11 00:22:56,014 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:22:56,014 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221875714]
[2021-10-11 00:22:56,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:22:56,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:22:56,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:22:56,241 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221875714]
[2021-10-11 00:22:56,241 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:22:56,242 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:22:56,242 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406219593]
[2021-10-11 00:22:56,243 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-10-11 00:22:56,243 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:22:56,243 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-11 00:22:56,244 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:22:56,244 INFO  L87              Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 7 states.
[2021-10-11 00:22:56,427 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:22:56,427 INFO  L93              Difference]: Finished difference Result 45 states and 63 transitions.
[2021-10-11 00:22:56,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-10-11 00:22:56,428 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2021-10-11 00:22:56,428 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:22:56,428 INFO  L225             Difference]: With dead ends: 45
[2021-10-11 00:22:56,429 INFO  L226             Difference]: Without dead ends: 26
[2021-10-11 00:22:56,429 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2021-10-11 00:22:56,429 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2021-10-11 00:22:56,430 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2021-10-11 00:22:56,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2021-10-11 00:22:56,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions.
[2021-10-11 00:22:56,431 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17
[2021-10-11 00:22:56,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:22:56,431 INFO  L481      AbstractCegarLoop]: Abstraction has 26 states and 33 transitions.
[2021-10-11 00:22:56,431 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-10-11 00:22:56,431 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions.
[2021-10-11 00:22:56,431 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-10-11 00:22:56,432 INFO  L414         BasicCegarLoop]: Found error trace
[2021-10-11 00:22:56,432 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:22:56,432 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-11 00:22:56,432 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:22:56,432 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:22:56,432 INFO  L82        PathProgramCache]: Analyzing trace with hash -508885551, now seen corresponding path program 3 times
[2021-10-11 00:22:56,433 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:22:56,433 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018765665]
[2021-10-11 00:22:56,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:22:56,544 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:22:56,544 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:22:56,613 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:22:56,613 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:22:56,674 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-11 00:22:56,674 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2021-10-11 00:22:56,674 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-11 00:22:56,778 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:22:56 BasicIcfg
[2021-10-11 00:22:56,778 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-11 00:22:56,779 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-11 00:22:56,779 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-10-11 00:22:56,779 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-10-11 00:22:56,779 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:45" (3/4) ...
[2021-10-11 00:22:56,781 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-11 00:22:56,903 INFO  L141         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4d35cfd-f251-4e20-9732-e5cc5cd141a5/bin/uautomizer-Z5i5R5N3CC/witness.graphml
[2021-10-11 00:22:56,903 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-11 00:22:56,904 INFO  L168              Benchmark]: Toolchain (without parser) took 14504.49 ms. Allocated memory was 117.4 MB in the beginning and 327.2 MB in the end (delta: 209.7 MB). Free memory was 85.9 MB in the beginning and 199.5 MB in the end (delta: -113.5 MB). Peak memory consumption was 94.4 MB. Max. memory is 16.1 GB.
[2021-10-11 00:22:56,905 INFO  L168              Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 88.1 MB. Free memory was 45.2 MB in the beginning and 45.1 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-11 00:22:56,905 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 782.60 ms. Allocated memory is still 117.4 MB. Free memory was 85.7 MB in the beginning and 70.5 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB.
[2021-10-11 00:22:56,907 INFO  L168              Benchmark]: Boogie Procedure Inliner took 52.29 ms. Allocated memory is still 117.4 MB. Free memory was 70.0 MB in the beginning and 67.9 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:22:56,908 INFO  L168              Benchmark]: Boogie Preprocessor took 42.11 ms. Allocated memory is still 117.4 MB. Free memory was 67.9 MB in the beginning and 65.8 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:22:56,908 INFO  L168              Benchmark]: RCFGBuilder took 2251.40 ms. Allocated memory was 117.4 MB in the beginning and 151.0 MB in the end (delta: 33.6 MB). Free memory was 65.8 MB in the beginning and 70.5 MB in the end (delta: -4.6 MB). Peak memory consumption was 53.8 MB. Max. memory is 16.1 GB.
[2021-10-11 00:22:56,909 INFO  L168              Benchmark]: TraceAbstraction took 11240.26 ms. Allocated memory was 151.0 MB in the beginning and 327.2 MB in the end (delta: 176.2 MB). Free memory was 70.5 MB in the beginning and 211.0 MB in the end (delta: -140.5 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB.
[2021-10-11 00:22:56,909 INFO  L168              Benchmark]: Witness Printer took 124.83 ms. Allocated memory is still 327.2 MB. Free memory was 211.0 MB in the beginning and 199.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
[2021-10-11 00:22:56,913 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.82 ms. Allocated memory is still 88.1 MB. Free memory was 45.2 MB in the beginning and 45.1 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB.
 * CACSL2BoogieTranslator took 782.60 ms. Allocated memory is still 117.4 MB. Free memory was 85.7 MB in the beginning and 70.5 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB.
 * Boogie Procedure Inliner took 52.29 ms. Allocated memory is still 117.4 MB. Free memory was 70.0 MB in the beginning and 67.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * Boogie Preprocessor took 42.11 ms. Allocated memory is still 117.4 MB. Free memory was 67.9 MB in the beginning and 65.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * RCFGBuilder took 2251.40 ms. Allocated memory was 117.4 MB in the beginning and 151.0 MB in the end (delta: 33.6 MB). Free memory was 65.8 MB in the beginning and 70.5 MB in the end (delta: -4.6 MB). Peak memory consumption was 53.8 MB. Max. memory is 16.1 GB.
 * TraceAbstraction took 11240.26 ms. Allocated memory was 151.0 MB in the beginning and 327.2 MB in the end (delta: 176.2 MB). Free memory was 70.5 MB in the beginning and 211.0 MB in the end (delta: -140.5 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB.
 * Witness Printer took 124.83 ms. Allocated memory is still 327.2 MB. Free memory was 211.0 MB in the beginning and 199.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    712 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 95 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.7s, 89 PlacesBefore, 28 PlacesAfterwards, 84 TransitionsBefore, 22 TransitionsAfterwards, 1058 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 2912 MoverChecksTotal
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L708]               0  int __unbuffered_cnt = 0;
[L710]               0  int __unbuffered_p1_EAX = 0;
[L712]               0  int __unbuffered_p1_EBX = 0;
[L713]               0  _Bool main$tmp_guard0;
[L714]               0  _Bool main$tmp_guard1;
[L716]               0  int x = 0;
[L718]               0  int y = 0;
[L720]               0  int z = 0;
[L721]               0  _Bool z$flush_delayed;
[L722]               0  int z$mem_tmp;
[L723]               0  _Bool z$r_buff0_thd0;
[L724]               0  _Bool z$r_buff0_thd1;
[L725]               0  _Bool z$r_buff0_thd2;
[L726]               0  _Bool z$r_buff1_thd0;
[L727]               0  _Bool z$r_buff1_thd1;
[L728]               0  _Bool z$r_buff1_thd2;
[L729]               0  _Bool z$read_delayed;
[L730]               0  int *z$read_delayed_var;
[L731]               0  int z$w_buff0;
[L732]               0  _Bool z$w_buff0_used;
[L733]               0  int z$w_buff1;
[L734]               0  _Bool z$w_buff1_used;
[L735]               0  _Bool weak$$choice0;
[L736]               0  _Bool weak$$choice2;
[L815]               0  pthread_t t1093;
[L816]  FCALL, FORK  0  pthread_create(&t1093, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L740]               1  z$w_buff1 = z$w_buff0
[L741]               1  z$w_buff0 = 1
[L742]               1  z$w_buff1_used = z$w_buff0_used
[L743]               1  z$w_buff0_used = (_Bool)1
[L18]   COND FALSE   1  !(!expression)
[L745]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L746]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L747]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L748]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L817]               0  pthread_t t1094;
[L818]  FCALL, FORK  0  pthread_create(&t1094, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L751]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L768]               2  x = 2
[L771]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L774]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L777]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L778]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L779]               2  z$flush_delayed = weak$$choice2
[L780]               2  z$mem_tmp = z
[L781]  EXPR         2  !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L781]               2  z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L782]  EXPR         2  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L782]               2  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L783]  EXPR         2  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L783]               2  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L784]  EXPR         2  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L784]               2  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L785]  EXPR         2  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L785]               2  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786]  EXPR         2  weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L786]               2  z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L787]  EXPR         2  weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L787]               2  z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L788]               2  __unbuffered_p1_EBX = z
[L789]  EXPR         2  z$flush_delayed ? z$mem_tmp : z
[L789]               2  z = z$flush_delayed ? z$mem_tmp : z
[L790]               2  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L754]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L754]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L755]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L755]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L756]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L756]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L757]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L757]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L758]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L758]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L761]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L763]               1  return 0;
[L793]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L793]  EXPR         2  z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z
[L793]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L793]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L794]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L794]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L795]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L795]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L796]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L796]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L797]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L797]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L800]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L802]               2  return 0;
[L820]               0  main$tmp_guard0 = __unbuffered_cnt == 2
[L3]    COND FALSE   0  !(!cond)
[L824]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L824]  EXPR         0  z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L824]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L824]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L825]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L825]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L826]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L826]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L827]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L827]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L828]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L828]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L831]               0  main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
[L18]   COND TRUE    0  !expression
[L18]                0  reach_error()
        VAL             [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.9s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 151 SDtfs, 142 SDslu, 222 SDs, 0 SdLazy, 114 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 42 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 6002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...