./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe013_rmo.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 7b2dab56
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/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_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe013_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/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_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/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 c085857e04282622880ff09f2cf2ee5d8844351a
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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:24:44,973 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-10-11 00:24:44,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-11 00:24:45,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-11 00:24:45,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-11 00:24:45,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-11 00:24:45,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-11 00:24:45,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-11 00:24:45,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-11 00:24:45,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-11 00:24:45,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-10-11 00:24:45,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-11 00:24:45,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-11 00:24:45,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-11 00:24:45,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-11 00:24:45,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-11 00:24:45,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-11 00:24:45,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-11 00:24:45,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-11 00:24:45,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-11 00:24:45,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-11 00:24:45,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-11 00:24:45,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-10-11 00:24:45,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-11 00:24:45,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-11 00:24:45,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-11 00:24:45,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-11 00:24:45,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-11 00:24:45,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-11 00:24:45,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-11 00:24:45,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-11 00:24:45,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-11 00:24:45,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-11 00:24:45,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-11 00:24:45,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-11 00:24:45,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-11 00:24:45,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-11 00:24:45,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-11 00:24:45,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-11 00:24:45,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-11 00:24:45,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-10-11 00:24:45,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-11 00:24:45,164 INFO L113 SettingsManager]: Loading preferences was successful
[2021-10-11 00:24:45,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-11 00:24:45,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-11 00:24:45,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-10-11 00:24:45,170 INFO L138 SettingsManager]: * Use SBE=true
[2021-10-11 00:24:45,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-11 00:24:45,171 INFO L138 SettingsManager]: * sizeof long=4
[2021-10-11 00:24:45,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-10-11 00:24:45,171 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-10-11 00:24:45,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-10-11 00:24:45,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-10-11 00:24:45,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-11 00:24:45,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-10-11 00:24:45,180 INFO L138 SettingsManager]: * sizeof long double=12
[2021-10-11 00:24:45,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-10-11 00:24:45,181 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-10-11 00:24:45,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-10-11 00:24:45,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-11 00:24:45,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-10-11 00:24:45,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-10-11 00:24:45,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:24:45,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-11 00:24:45,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-10-11 00:24:45,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-11 00:24:45,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-10-11 00:24:45,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-11 00:24:45,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-11 00:24:45,184 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-10-11 00:24:45,185 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_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/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_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/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 -> c085857e04282622880ff09f2cf2ee5d8844351a
[2021-10-11 00:24:45,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-11 00:24:45,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-11 00:24:45,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-11 00:24:45,528 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-10-11 00:24:45,529 INFO L275 PluginConnector]: CDTParser initialized
[2021-10-11 00:24:45,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/safe013_rmo.opt.i
[2021-10-11 00:24:45,613 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/bin/uautomizer-Z5i5R5N3CC/data/7d78917b8/c9632bfa899343a3b88ffef55a0c8320/FLAG4865509d7
[2021-10-11 00:24:46,240 INFO L306 CDTParser]: Found 1 translation units.
[2021-10-11 00:24:46,240 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/sv-benchmarks/c/pthread-wmm/safe013_rmo.opt.i
[2021-10-11 00:24:46,259 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/bin/uautomizer-Z5i5R5N3CC/data/7d78917b8/c9632bfa899343a3b88ffef55a0c8320/FLAG4865509d7
[2021-10-11 00:24:46,457 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/bin/uautomizer-Z5i5R5N3CC/data/7d78917b8/c9632bfa899343a3b88ffef55a0c8320
[2021-10-11 00:24:46,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-11 00:24:46,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-11 00:24:46,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-11 00:24:46,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-11 00:24:46,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-11 00:24:46,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:24:46" (1/1) ...
[2021-10-11 00:24:46,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b33e401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:46, skipping insertion in model container
[2021-10-11 00:24:46,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:24:46" (1/1) ...
[2021-10-11 00:24:46,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-10-11 00:24:46,525 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-10-11 00:24:46,726 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_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/sv-benchmarks/c/pthread-wmm/safe013_rmo.opt.i[992,1005]
[2021-10-11 00:24:46,933 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:24:46,942 INFO L203 MainTranslator]: Completed pre-run
[2021-10-11 00:24:46,955 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_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/sv-benchmarks/c/pthread-wmm/safe013_rmo.opt.i[992,1005]
[2021-10-11 00:24:47,003 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:24:47,082 INFO L208 MainTranslator]: Completed translation
[2021-10-11 00:24:47,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:47 WrapperNode
[2021-10-11 00:24:47,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-11 00:24:47,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-11 00:24:47,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-11 00:24:47,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-11 00:24:47,093 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:24:47" (1/1) ...
[2021-10-11 00:24:47,112 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:24:47" (1/1) ...
[2021-10-11 00:24:47,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-11 00:24:47,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-11 00:24:47,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-11 00:24:47,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-10-11 00:24:47,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:47" (1/1) ...
[2021-10-11 00:24:47,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:47" (1/1) ...
[2021-10-11 00:24:47,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:47" (1/1) ...
[2021-10-11 00:24:47,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:47" (1/1) ...
[2021-10-11 00:24:47,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:47" (1/1) ...
[2021-10-11 00:24:47,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:47" (1/1) ...
[2021-10-11 00:24:47,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:47" (1/1) ...
[2021-10-11 00:24:47,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-11 00:24:47,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-11 00:24:47,235 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-10-11 00:24:47,235 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-10-11 00:24:47,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:47" (1/1) ...
No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/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:24:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-10-11 00:24:47,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-10-11 00:24:47,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-11 00:24:47,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-11 00:24:47,325 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-10-11 00:24:47,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-10-11 00:24:47,325 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-10-11 00:24:47,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-10-11 00:24:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-10-11 00:24:47,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-10-11 00:24:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-11 00:24:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-10-11 00:24:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-11 00:24:47,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-11 00:24:47,329 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:24:49,623 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-11 00:24:49,623 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-10-11 00:24:49,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:24:49 BoogieIcfgContainer
[2021-10-11 00:24:49,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-11 00:24:49,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-11 00:24:49,627 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-10-11 00:24:49,632 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-10-11 00:24:49,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:24:46" (1/3) ...
[2021-10-11 00:24:49,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5aa07e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:24:49, skipping insertion in model container
[2021-10-11 00:24:49,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:24:47" (2/3) ...
[2021-10-11 00:24:49,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5aa07e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:24:49, skipping insertion in model container
[2021-10-11 00:24:49,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:24:49" (3/3) ...
[2021-10-11 00:24:49,638 INFO L111 eAbstractionObserver]: Analyzing ICFG safe013_rmo.opt.i
[2021-10-11 00:24:49,653 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-10-11 00:24:49,653 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-11 00:24:49,658 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-10-11 00:24:49,658 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-10-11 00:24:49,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,728 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,728 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,758 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,759 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,765 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,766 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,782 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,782 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,783 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,783 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,800 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,800 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,801 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,804 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,804 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:24:49,806 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-10-11 00:24:49,818 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-10-11 00:24:49,854 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2021-10-11 00:24:49,854 INFO L378 AbstractCegarLoop]: Hoare is true
[2021-10-11 00:24:49,854 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-10-11 00:24:49,854 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-11 00:24:49,854 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-11 00:24:49,854 INFO L382 AbstractCegarLoop]: Difference is false
[2021-10-11 00:24:49,855 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-11 00:24:49,855 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-10-11 00:24:49,871 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-10-11 00:24:49,875 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow
[2021-10-11 00:24:49,879 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow
[2021-10-11 00:24:49,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow
[2021-10-11 00:24:49,933 INFO L129 PetriNetUnfolder]: 2/94 cut-off events.
[2021-10-11 00:24:49,933 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-11 00:24:49,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place.
[2021-10-11 00:24:49,942 INFO L116 LiptonReduction]: Number of co-enabled transitions 1586
[2021-10-11 00:24:50,293 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:50,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:24:50,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:50,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:50,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:50,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:50,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:50,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:50,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:50,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:50,488 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:50,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:50,492 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:24:50,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:50,494 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:24:50,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:50,497 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:24:50,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:50,743 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term
[2021-10-11 00:24:50,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:50,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term
[2021-10-11 00:24:50,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:50,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term
[2021-10-11 00:24:50,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:51,226 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53
[2021-10-11 00:24:51,873 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-10-11 00:24:52,505 WARN L197 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84
[2021-10-11 00:24:52,657 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-10-11 00:24:52,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:52,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:52,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:52,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:52,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:52,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:52,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:52,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:52,726 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:24:52,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:52,729 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:24:52,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:52,730 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:24:52,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:52,795 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:52,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:24:52,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:52,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:52,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:52,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:52,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:52,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:52,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:52,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:52,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:52,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:53,003 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:24:53,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:53,034 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:24:53,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:53,037 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:24:53,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:53,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:53,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:24:53,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:53,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:53,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:53,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:24:53,741 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:53,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:53,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:53,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:53,826 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:53,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:53,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:53,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:53,831 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:53,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:53,834 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:24:53,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:53,836 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:24:53,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:53,847 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:24:53,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:53,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:53,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:24:53,952 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:53,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:54,015 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:54,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:54,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:54,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:54,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:54,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:54,039 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:54,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:54,046 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:24:54,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:54,048 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:24:54,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:54,051 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:24:54,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:54,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:54,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:24:54,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:54,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:54,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:54,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:54,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:54,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:54,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:54,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:54,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:54,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:54,307 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:24:54,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:54,309 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:24:54,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:54,311 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:24:54,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:54,624 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term
[2021-10-11 00:24:54,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:54,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term
[2021-10-11 00:24:54,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:54,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term
[2021-10-11 00:24:54,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:54,949 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 62
[2021-10-11 00:24:55,062 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 62
[2021-10-11 00:24:55,471 WARN L197 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90
[2021-10-11 00:24:55,680 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 89
[2021-10-11 00:24:55,713 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:55,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:55,716 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:55,717 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:24:55,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:55,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:55,738 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:55,740 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:55,742 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:24:55,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:55,802 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:55,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:55,805 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:55,807 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:24:55,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:55,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:55,829 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:55,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:55,832 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:24:55,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:55,991 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:55,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:55,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:55,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:55,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:55,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:55,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:55,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:56,001 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:24:56,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,003 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:24:56,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,004 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:24:56,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:56,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:24:56,058 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:56,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:56,412 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:24:56,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:56,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,435 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:24:56,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,625 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:56,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:24:56,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:56,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:56,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:56,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:56,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:56,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:56,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:56,682 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:24:56,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,683 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:24:56,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,685 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:24:56,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,728 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:24:56,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:56,750 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:24:56,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:56,782 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,787 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:24:56,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,808 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,809 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:56,813 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:24:56,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:56,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,839 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,841 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:56,843 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:24:56,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:56,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,868 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:24:56,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:56,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:56,923 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:56,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:56,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:56,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:56,926 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:56,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:56,928 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:24:56,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,930 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:24:56,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,932 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:24:56,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:56,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:56,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:24:56,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:56,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:57,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:57,186 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:57,192 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:24:57,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:57,573 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:57,578 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:24:57,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:57,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:57,602 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:24:57,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:24:57,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:57,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:24:57,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:24:57,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:24:57,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:24:57,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:57,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:57,702 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:57,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:57,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:24:57,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:24:57,705 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:24:57,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:57,707 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:24:57,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:57,709 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:24:57,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:58,141 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64
[2021-10-11 00:24:58,329 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64
[2021-10-11 00:24:59,100 WARN L197 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114
[2021-10-11 00:24:59,291 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 110
[2021-10-11 00:24:59,667 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114
[2021-10-11 00:24:59,833 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 110
[2021-10-11 00:24:59,907 INFO L131 LiptonReduction]: Checked pairs total: 4301
[2021-10-11 00:24:59,907 INFO L133 LiptonReduction]: Total number of compositions: 86
[2021-10-11 00:24:59,914 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow
[2021-10-11 00:24:59,963 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 658 states.
[2021-10-11 00:24:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states.
[2021-10-11 00:24:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2021-10-11 00:24:59,971 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:59,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2021-10-11 00:24:59,972 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:59,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:59,979 INFO L82 PathProgramCache]: Analyzing trace with hash 930658083, now seen corresponding path program 1 times
[2021-10-11 00:24:59,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:59,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713108635]
[2021-10-11 00:24:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:00,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713108635]
[2021-10-11 00:25:00,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:00,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:25:00,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704702801]
[2021-10-11 00:25:00,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:25:00,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:00,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:25:00,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:25:00,292 INFO L87 Difference]: Start difference. First operand 658 states. Second operand 3 states.
[2021-10-11 00:25:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:00,417 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions.
[2021-10-11 00:25:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:25:00,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2021-10-11 00:25:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:00,455 INFO L225 Difference]: With dead ends: 550
[2021-10-11 00:25:00,455 INFO L226 Difference]: Without dead ends: 450
[2021-10-11 00:25:00,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:25:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states.
[2021-10-11 00:25:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450.
[2021-10-11 00:25:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states.
[2021-10-11 00:25:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions.
[2021-10-11 00:25:00,571 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5
[2021-10-11 00:25:00,572 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:00,572 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions.
[2021-10-11 00:25:00,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:25:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions.
[2021-10-11 00:25:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2021-10-11 00:25:00,574 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:00,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:00,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-11 00:25:00,575 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:00,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:00,575 INFO L82 PathProgramCache]: Analyzing trace with hash -754131412, now seen corresponding path program 1 times
[2021-10-11 00:25:00,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:00,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638319000]
[2021-10-11 00:25:00,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:00,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638319000]
[2021-10-11 00:25:00,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:00,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:25:00,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181708490]
[2021-10-11 00:25:00,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:25:00,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:00,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:25:00,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:25:00,729 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states.
[2021-10-11 00:25:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:00,748 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions.
[2021-10-11 00:25:00,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:25:00,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2021-10-11 00:25:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:00,760 INFO L225 Difference]: With dead ends: 440
[2021-10-11 00:25:00,767 INFO L226 Difference]: Without dead ends: 440
[2021-10-11 00:25:00,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:25:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states.
[2021-10-11 00:25:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440.
[2021-10-11 00:25:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states.
[2021-10-11 00:25:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions.
[2021-10-11 00:25:00,816 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9
[2021-10-11 00:25:00,817 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:00,817 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions.
[2021-10-11 00:25:00,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:25:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions.
[2021-10-11 00:25:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2021-10-11 00:25:00,820 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:00,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:00,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-11 00:25:00,821 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:00,821 INFO L82 PathProgramCache]: Analyzing trace with hash 250183498, now seen corresponding path program 1 times
[2021-10-11 00:25:00,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:00,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267904248]
[2021-10-11 00:25:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:00,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267904248]
[2021-10-11 00:25:00,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:00,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:25:00,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787867007]
[2021-10-11 00:25:00,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:25:00,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:25:00,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:00,942 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states.
[2021-10-11 00:25:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:00,981 INFO L93 Difference]: Finished difference Result 590 states and 1690 transitions.
[2021-10-11 00:25:00,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-11 00:25:00,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2021-10-11 00:25:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:00,987 INFO L225 Difference]: With dead ends: 590
[2021-10-11 00:25:00,988 INFO L226 Difference]: Without dead ends: 500
[2021-10-11 00:25:00,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states.
[2021-10-11 00:25:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 455.
[2021-10-11 00:25:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states.
[2021-10-11 00:25:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1327 transitions.
[2021-10-11 00:25:01,013 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1327 transitions. Word has length 10
[2021-10-11 00:25:01,014 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:01,014 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 1327 transitions.
[2021-10-11 00:25:01,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:25:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1327 transitions.
[2021-10-11 00:25:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-10-11 00:25:01,017 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:01,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:01,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-11 00:25:01,018 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash -834094923, now seen corresponding path program 1 times
[2021-10-11 00:25:01,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:01,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477197834]
[2021-10-11 00:25:01,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:01,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477197834]
[2021-10-11 00:25:01,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:01,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:25:01,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637919902]
[2021-10-11 00:25:01,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:25:01,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:01,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:25:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:01,147 INFO L87 Difference]: Start difference. First operand 455 states and 1327 transitions. Second operand 4 states.
[2021-10-11 00:25:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:01,197 INFO L93 Difference]: Finished difference Result 554 states and 1564 transitions.
[2021-10-11 00:25:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:25:01,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2021-10-11 00:25:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:01,203 INFO L225 Difference]: With dead ends: 554
[2021-10-11 00:25:01,203 INFO L226 Difference]: Without dead ends: 524
[2021-10-11 00:25:01,204 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:25:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states.
[2021-10-11 00:25:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 470.
[2021-10-11 00:25:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states.
[2021-10-11 00:25:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1367 transitions.
[2021-10-11 00:25:01,224 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1367 transitions. Word has length 11
[2021-10-11 00:25:01,225 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:01,225 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 1367 transitions.
[2021-10-11 00:25:01,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:25:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1367 transitions.
[2021-10-11 00:25:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-10-11 00:25:01,227 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:01,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:01,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-11 00:25:01,227 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:01,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:01,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1133697783, now seen corresponding path program 2 times
[2021-10-11 00:25:01,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:01,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7754945]
[2021-10-11 00:25:01,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:01,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7754945]
[2021-10-11 00:25:01,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:01,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:25:01,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381424020]
[2021-10-11 00:25:01,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:25:01,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:01,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:25:01,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:25:01,293 INFO L87 Difference]: Start difference. First operand 470 states and 1367 transitions. Second operand 5 states.
[2021-10-11 00:25:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:01,336 INFO L93 Difference]: Finished difference Result 644 states and 1810 transitions.
[2021-10-11 00:25:01,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:25:01,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2021-10-11 00:25:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:01,340 INFO L225 Difference]: With dead ends: 644
[2021-10-11 00:25:01,340 INFO L226 Difference]: Without dead ends: 344
[2021-10-11 00:25:01,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:25:01,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states.
[2021-10-11 00:25:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 317.
[2021-10-11 00:25:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states.
[2021-10-11 00:25:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 869 transitions.
[2021-10-11 00:25:01,354 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 869 transitions. Word has length 11
[2021-10-11 00:25:01,354 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:01,354 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 869 transitions.
[2021-10-11 00:25:01,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:25:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 869 transitions.
[2021-10-11 00:25:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2021-10-11 00:25:01,355 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:01,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:01,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-11 00:25:01,356 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash 276995238, now seen corresponding path program 1 times
[2021-10-11 00:25:01,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:01,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368971617]
[2021-10-11 00:25:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:01,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368971617]
[2021-10-11 00:25:01,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:01,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:25:01,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006907029]
[2021-10-11 00:25:01,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:25:01,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:01,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:25:01,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:01,437 INFO L87 Difference]: Start difference. First operand 317 states and 869 transitions. Second operand 4 states.
[2021-10-11 00:25:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:01,467 INFO L93 Difference]: Finished difference Result 314 states and 761 transitions.
[2021-10-11 00:25:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-11 00:25:01,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2021-10-11 00:25:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:01,470 INFO L225 Difference]: With dead ends: 314
[2021-10-11 00:25:01,470 INFO L226 Difference]: Without dead ends: 237
[2021-10-11 00:25:01,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:25:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states.
[2021-10-11 00:25:01,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237.
[2021-10-11 00:25:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states.
[2021-10-11 00:25:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 565 transitions.
[2021-10-11 00:25:01,480 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 565 transitions. Word has length 13
[2021-10-11 00:25:01,480 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:01,480 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 565 transitions.
[2021-10-11 00:25:01,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:25:01,481 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 565 transitions.
[2021-10-11 00:25:01,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-11 00:25:01,482 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:01,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:01,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-11 00:25:01,482 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:01,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:01,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2088521890, now seen corresponding path program 1 times
[2021-10-11 00:25:01,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:01,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981268799]
[2021-10-11 00:25:01,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:01,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981268799]
[2021-10-11 00:25:01,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:01,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:25:01,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002412777]
[2021-10-11 00:25:01,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:25:01,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:01,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:25:01,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:25:01,606 INFO L87 Difference]: Start difference. First operand 237 states and 565 transitions. Second operand 5 states.
[2021-10-11 00:25:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:01,656 INFO L93 Difference]: Finished difference Result 200 states and 435 transitions.
[2021-10-11 00:25:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:25:01,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2021-10-11 00:25:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:01,659 INFO L225 Difference]: With dead ends: 200
[2021-10-11 00:25:01,659 INFO L226 Difference]: Without dead ends: 157
[2021-10-11 00:25:01,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:25:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states.
[2021-10-11 00:25:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157.
[2021-10-11 00:25:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states.
[2021-10-11 00:25:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 335 transitions.
[2021-10-11 00:25:01,667 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 335 transitions. Word has length 15
[2021-10-11 00:25:01,667 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:01,667 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 335 transitions.
[2021-10-11 00:25:01,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:25:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 335 transitions.
[2021-10-11 00:25:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-10-11 00:25:01,668 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:01,669 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:25:01,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-11 00:25:01,669 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:01,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:01,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1212545442, now seen corresponding path program 1 times
[2021-10-11 00:25:01,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:01,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318177006]
[2021-10-11 00:25:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:01,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318177006]
[2021-10-11 00:25:01,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:01,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:25:01,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670915396]
[2021-10-11 00:25:01,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:25:01,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:01,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:25:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:25:01,792 INFO L87 Difference]: Start difference. First operand 157 states and 335 transitions. Second operand 6 states.
[2021-10-11 00:25:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:01,876 INFO L93 Difference]: Finished difference Result 141 states and 302 transitions.
[2021-10-11 00:25:01,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:25:01,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2021-10-11 00:25:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:01,878 INFO L225 Difference]: With dead ends: 141
[2021-10-11 00:25:01,878 INFO L226 Difference]: Without dead ends: 90
[2021-10-11 00:25:01,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2021-10-11 00:25:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2021-10-11 00:25:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81.
[2021-10-11 00:25:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2021-10-11 00:25:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 164 transitions.
[2021-10-11 00:25:01,887 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 164 transitions. Word has length 17
[2021-10-11 00:25:01,887 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:01,888 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 164 transitions.
[2021-10-11 00:25:01,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:25:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 164 transitions.
[2021-10-11 00:25:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-10-11 00:25:01,889 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:01,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:01,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-11 00:25:01,889 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash -601691607, now seen corresponding path program 1 times
[2021-10-11 00:25:01,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:01,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764653152]
[2021-10-11 00:25:01,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:02,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764653152]
[2021-10-11 00:25:02,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:02,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:25:02,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699898786]
[2021-10-11 00:25:02,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:25:02,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:02,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:25:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:02,016 INFO L87 Difference]: Start difference. First operand 81 states and 164 transitions. Second operand 4 states.
[2021-10-11 00:25:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:02,037 INFO L93 Difference]: Finished difference Result 110 states and 220 transitions.
[2021-10-11 00:25:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-11 00:25:02,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2021-10-11 00:25:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:02,039 INFO L225 Difference]: With dead ends: 110
[2021-10-11 00:25:02,039 INFO L226 Difference]: Without dead ends: 61
[2021-10-11 00:25:02,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:25:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2021-10-11 00:25:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2021-10-11 00:25:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2021-10-11 00:25:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions.
[2021-10-11 00:25:02,042 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 20
[2021-10-11 00:25:02,042 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:02,043 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 112 transitions.
[2021-10-11 00:25:02,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:25:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions.
[2021-10-11 00:25:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-10-11 00:25:02,043 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:02,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:02,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-11 00:25:02,044 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:02,044 INFO L82 PathProgramCache]: Analyzing trace with hash -847487105, now seen corresponding path program 2 times
[2021-10-11 00:25:02,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:02,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897425231]
[2021-10-11 00:25:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:25:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:25:02,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897425231]
[2021-10-11 00:25:02,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:25:02,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:25:02,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132379491]
[2021-10-11 00:25:02,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-10-11 00:25:02,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:25:02,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-11 00:25:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:25:02,296 INFO L87 Difference]: Start difference. First operand 61 states and 112 transitions. Second operand 7 states.
[2021-10-11 00:25:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:25:02,410 INFO L93 Difference]: Finished difference Result 75 states and 134 transitions.
[2021-10-11 00:25:02,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:25:02,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20
[2021-10-11 00:25:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:25:02,411 INFO L225 Difference]: With dead ends: 75
[2021-10-11 00:25:02,411 INFO L226 Difference]: Without dead ends: 41
[2021-10-11 00:25:02,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2021-10-11 00:25:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2021-10-11 00:25:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2021-10-11 00:25:02,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2021-10-11 00:25:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions.
[2021-10-11 00:25:02,413 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20
[2021-10-11 00:25:02,413 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:25:02,413 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions.
[2021-10-11 00:25:02,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-10-11 00:25:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions.
[2021-10-11 00:25:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-10-11 00:25:02,414 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:25:02,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:25:02,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-11 00:25:02,414 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:25:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:25:02,415 INFO L82 PathProgramCache]: Analyzing trace with hash -785218185, now seen corresponding path program 3 times
[2021-10-11 00:25:02,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:25:02,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049939500]
[2021-10-11 00:25:02,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:25:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:25:02,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:25:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:25:02,585 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:25:02,655 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-11 00:25:02,655 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2021-10-11 00:25:02,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-10-11 00:25:02,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:25:02 BasicIcfg
[2021-10-11 00:25:02,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-11 00:25:02,800 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-11 00:25:02,800 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-10-11 00:25:02,800 INFO L275 PluginConnector]: Witness Printer initialized
[2021-10-11 00:25:02,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:24:49" (3/4) ...
[2021-10-11 00:25:02,803 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-11 00:25:02,978 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31076ad1-718a-4a0b-b0e6-527cdae4bdcc/bin/uautomizer-Z5i5R5N3CC/witness.graphml
[2021-10-11 00:25:02,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-11 00:25:02,979 INFO L168 Benchmark]: Toolchain (without parser) took 16518.01 ms. Allocated memory was 113.2 MB in the beginning and 385.9 MB in the end (delta: 272.6 MB). Free memory was 88.6 MB in the beginning and 318.2 MB in the end (delta: -229.6 MB). Peak memory consumption was 41.3 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:02,980 INFO L168 Benchmark]: CDTParser took 0.86 ms. Allocated memory is still 113.2 MB. Free memory was 70.8 MB in the beginning and 70.8 MB in the end (delta: 59.5 kB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-11 00:25:02,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.75 ms. Allocated memory is still 113.2 MB. Free memory was 88.2 MB in the beginning and 65.4 MB in the end (delta: 22.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:02,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.91 ms. Allocated memory is still 113.2 MB. Free memory was 65.4 MB in the beginning and 62.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:02,981 INFO L168 Benchmark]: Boogie Preprocessor took 78.05 ms. Allocated memory is still 113.2 MB. Free memory was 62.8 MB in the beginning and 60.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:02,982 INFO L168 Benchmark]: RCFGBuilder took 2390.61 ms. Allocated memory was 113.2 MB in the beginning and 148.9 MB in the end (delta: 35.7 MB). Free memory was 60.5 MB in the beginning and 119.4 MB in the end (delta: -58.9 MB). Peak memory consumption was 45.3 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:02,983 INFO L168 Benchmark]: TraceAbstraction took 13172.10 ms. Allocated memory was 148.9 MB in the beginning and 385.9 MB in the end (delta: 237.0 MB). Free memory was 119.4 MB in the beginning and 332.9 MB in the end (delta: -213.5 MB). Peak memory consumption was 186.0 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:02,983 INFO L168 Benchmark]: Witness Printer took 178.77 ms. Allocated memory is still 385.9 MB. Free memory was 332.9 MB in the beginning and 318.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB.
[2021-10-11 00:25:02,988 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.86 ms. Allocated memory is still 113.2 MB. Free memory was 70.8 MB in the beginning and 70.8 MB in the end (delta: 59.5 kB). There was no memory consumed. Max. memory is 16.1 GB.
* CACSL2BoogieTranslator took 620.75 ms. Allocated memory is still 113.2 MB. Free memory was 88.2 MB in the beginning and 65.4 MB in the end (delta: 22.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB.
* Boogie Procedure Inliner took 68.91 ms. Allocated memory is still 113.2 MB. Free memory was 65.4 MB in the beginning and 62.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
* Boogie Preprocessor took 78.05 ms. Allocated memory is still 113.2 MB. Free memory was 62.8 MB in the beginning and 60.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* RCFGBuilder took 2390.61 ms. Allocated memory was 113.2 MB in the beginning and 148.9 MB in the end (delta: 35.7 MB). Free memory was 60.5 MB in the beginning and 119.4 MB in the end (delta: -58.9 MB). Peak memory consumption was 45.3 MB. Max. memory is 16.1 GB.
* TraceAbstraction took 13172.10 ms. Allocated memory was 148.9 MB in the beginning and 385.9 MB in the end (delta: 237.0 MB). Free memory was 119.4 MB in the beginning and 332.9 MB in the end (delta: -213.5 MB). Peak memory consumption was 186.0 MB. Max. memory is 16.1 GB.
* Witness Printer took 178.77 ms. Allocated memory is still 385.9 MB. Free memory was 332.9 MB in the beginning and 318.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1104 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 52 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.0s, 138 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.0s, 105 PlacesBefore, 35 PlacesAfterwards, 97 TransitionsBefore, 26 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 4301 MoverChecksTotal
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p2_EAX = 0;
[L715] 0 _Bool main$tmp_guard0;
[L716] 0 _Bool main$tmp_guard1;
[L718] 0 int x = 0;
[L719] 0 _Bool x$flush_delayed;
[L720] 0 int x$mem_tmp;
[L721] 0 _Bool x$r_buff0_thd0;
[L722] 0 _Bool x$r_buff0_thd1;
[L723] 0 _Bool x$r_buff0_thd2;
[L724] 0 _Bool x$r_buff0_thd3;
[L725] 0 _Bool x$r_buff1_thd0;
[L726] 0 _Bool x$r_buff1_thd1;
[L727] 0 _Bool x$r_buff1_thd2;
[L728] 0 _Bool x$r_buff1_thd3;
[L729] 0 _Bool x$read_delayed;
[L730] 0 int *x$read_delayed_var;
[L731] 0 int x$w_buff0;
[L732] 0 _Bool x$w_buff0_used;
[L733] 0 int x$w_buff1;
[L734] 0 _Bool x$w_buff1_used;
[L736] 0 int y = 0;
[L738] 0 int z = 0;
[L739] 0 _Bool weak$$choice0;
[L740] 0 _Bool weak$$choice2;
[L831] 0 pthread_t t2088;
[L832] FCALL, FORK 0 pthread_create(&t2088, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L833] 0 pthread_t t2089;
[L834] FCALL, FORK 0 pthread_create(&t2089, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L774] 2 x$w_buff1 = x$w_buff0
[L775] 2 x$w_buff0 = 1
[L776] 2 x$w_buff1_used = x$w_buff0_used
[L777] 2 x$w_buff0_used = (_Bool)1
[L19] COND FALSE 2 !(!expression)
[L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L783] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L835] 0 pthread_t t2090;
[L836] FCALL, FORK 0 pthread_create(&t2090, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L786] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L803] 3 __unbuffered_p2_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L806] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L818] 3 return 0;
[L744] 1 z = 2
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L749] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L750] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L751] 1 x$flush_delayed = weak$$choice2
[L752] 1 x$mem_tmp = x
[L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L760] 1 __unbuffered_p0_EAX = x
[L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L761] 1 x = x$flush_delayed ? x$mem_tmp : x
[L762] 1 x$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L769] 1 return 0;
[L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L798] 2 return 0;
[L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L4] COND FALSE 0 !(!cond)
[L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1)
[L19] COND TRUE 0 !expression
[L19] 0 reach_error()
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 194 SDtfs, 316 SDslu, 309 SDs, 0 SdLazy, 124 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 135 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 9862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...