./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_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_b12362e0-2547-4af8-aeb0-beed18648ffd/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/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_b12362e0-2547-4af8-aeb0-beed18648ffd/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/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_b12362e0-2547-4af8-aeb0-beed18648ffd/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 8accfd2316880493be3cab55de0cda1ff0dcb0af
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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:23:36,493 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-10-11 00:23:36,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-11 00:23:36,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-11 00:23:36,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-11 00:23:36,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-11 00:23:36,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-11 00:23:36,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-11 00:23:36,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-11 00:23:36,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-11 00:23:36,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-10-11 00:23:36,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-11 00:23:36,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-11 00:23:36,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-11 00:23:36,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-11 00:23:36,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-11 00:23:36,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-11 00:23:36,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-11 00:23:36,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-11 00:23:36,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-11 00:23:36,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-11 00:23:36,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-11 00:23:36,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-10-11 00:23:36,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-11 00:23:36,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-11 00:23:36,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-11 00:23:36,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-11 00:23:36,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-11 00:23:36,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-11 00:23:36,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-11 00:23:36,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-11 00:23:36,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-11 00:23:36,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-11 00:23:36,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-11 00:23:36,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-11 00:23:36,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-11 00:23:36,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-11 00:23:36,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-11 00:23:36,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-11 00:23:36,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-11 00:23:36,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-10-11 00:23:36,571 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-11 00:23:36,594 INFO L113 SettingsManager]: Loading preferences was successful
[2021-10-11 00:23:36,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-11 00:23:36,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-11 00:23:36,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-10-11 00:23:36,597 INFO L138 SettingsManager]: * Use SBE=true
[2021-10-11 00:23:36,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-11 00:23:36,597 INFO L138 SettingsManager]: * sizeof long=4
[2021-10-11 00:23:36,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-10-11 00:23:36,598 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-10-11 00:23:36,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-10-11 00:23:36,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-10-11 00:23:36,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-11 00:23:36,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-10-11 00:23:36,602 INFO L138 SettingsManager]: * sizeof long double=12
[2021-10-11 00:23:36,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-10-11 00:23:36,602 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-10-11 00:23:36,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-10-11 00:23:36,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-11 00:23:36,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-10-11 00:23:36,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-10-11 00:23:36,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:23:36,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-11 00:23:36,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-10-11 00:23:36,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-11 00:23:36,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-10-11 00:23:36,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-11 00:23:36,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-11 00:23:36,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-10-11 00:23:36,606 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_b12362e0-2547-4af8-aeb0-beed18648ffd/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_b12362e0-2547-4af8-aeb0-beed18648ffd/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 -> 8accfd2316880493be3cab55de0cda1ff0dcb0af
[2021-10-11 00:23:36,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-11 00:23:36,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-11 00:23:36,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-11 00:23:36,935 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-10-11 00:23:36,936 INFO L275 PluginConnector]: CDTParser initialized
[2021-10-11 00:23:36,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/mix044_rmo.opt.i
[2021-10-11 00:23:37,027 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/bin/uautomizer-Z5i5R5N3CC/data/85bb6b7c2/88904582f80e4d25a487066dce8eaffd/FLAG373577c20
[2021-10-11 00:23:37,656 INFO L306 CDTParser]: Found 1 translation units.
[2021-10-11 00:23:37,657 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/sv-benchmarks/c/pthread-wmm/mix044_rmo.opt.i
[2021-10-11 00:23:37,676 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/bin/uautomizer-Z5i5R5N3CC/data/85bb6b7c2/88904582f80e4d25a487066dce8eaffd/FLAG373577c20
[2021-10-11 00:23:37,909 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/bin/uautomizer-Z5i5R5N3CC/data/85bb6b7c2/88904582f80e4d25a487066dce8eaffd
[2021-10-11 00:23:37,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-11 00:23:37,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-11 00:23:37,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-11 00:23:37,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-11 00:23:37,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-11 00:23:37,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:23:37" (1/1) ...
[2021-10-11 00:23:37,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b014ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:37, skipping insertion in model container
[2021-10-11 00:23:37,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:23:37" (1/1) ...
[2021-10-11 00:23:37,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-10-11 00:23:38,019 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-10-11 00:23:38,213 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_b12362e0-2547-4af8-aeb0-beed18648ffd/sv-benchmarks/c/pthread-wmm/mix044_rmo.opt.i[948,961]
[2021-10-11 00:23:38,499 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:23:38,508 INFO L203 MainTranslator]: Completed pre-run
[2021-10-11 00:23:38,519 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_b12362e0-2547-4af8-aeb0-beed18648ffd/sv-benchmarks/c/pthread-wmm/mix044_rmo.opt.i[948,961]
[2021-10-11 00:23:38,559 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:23:38,631 INFO L208 MainTranslator]: Completed translation
[2021-10-11 00:23:38,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:38 WrapperNode
[2021-10-11 00:23:38,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-11 00:23:38,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-11 00:23:38,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-11 00:23:38,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-11 00:23:38,641 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:23:38" (1/1) ...
[2021-10-11 00:23:38,658 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:23:38" (1/1) ...
[2021-10-11 00:23:38,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-11 00:23:38,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-11 00:23:38,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-11 00:23:38,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-10-11 00:23:38,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:38" (1/1) ...
[2021-10-11 00:23:38,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:38" (1/1) ...
[2021-10-11 00:23:38,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:38" (1/1) ...
[2021-10-11 00:23:38,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:38" (1/1) ...
[2021-10-11 00:23:38,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:38" (1/1) ...
[2021-10-11 00:23:38,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:38" (1/1) ...
[2021-10-11 00:23:38,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:38" (1/1) ...
[2021-10-11 00:23:38,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-11 00:23:38,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-11 00:23:38,729 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-10-11 00:23:38,729 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-10-11 00:23:38,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:38" (1/1) ...
No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/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:23:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-10-11 00:23:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-10-11 00:23:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-11 00:23:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-11 00:23:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-10-11 00:23:38,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-10-11 00:23:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-10-11 00:23:38,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-10-11 00:23:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-10-11 00:23:38,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-10-11 00:23:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2021-10-11 00:23:38,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2021-10-11 00:23:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-11 00:23:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-10-11 00:23:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-11 00:23:38,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-11 00:23:38,859 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:23:41,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-11 00:23:41,388 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-10-11 00:23:41,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:23:41 BoogieIcfgContainer
[2021-10-11 00:23:41,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-11 00:23:41,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-11 00:23:41,395 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-10-11 00:23:41,398 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-10-11 00:23:41,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:23:37" (1/3) ...
[2021-10-11 00:23:41,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661965d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:23:41, skipping insertion in model container
[2021-10-11 00:23:41,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:38" (2/3) ...
[2021-10-11 00:23:41,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661965d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:23:41, skipping insertion in model container
[2021-10-11 00:23:41,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:23:41" (3/3) ...
[2021-10-11 00:23:41,402 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_rmo.opt.i
[2021-10-11 00:23:41,416 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-10-11 00:23:41,416 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-11 00:23:41,420 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-10-11 00:23:41,420 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-10-11 00:23:41,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,471 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,471 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,472 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,472 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,475 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,475 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,477 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,477 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,478 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,478 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,483 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,483 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,483 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,483 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,484 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,484 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,485 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,485 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,496 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,501 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,513 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,513 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,515 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,515 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,515 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,515 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,516 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:41,517 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-10-11 00:23:41,529 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2021-10-11 00:23:41,563 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2021-10-11 00:23:41,563 INFO L378 AbstractCegarLoop]: Hoare is true
[2021-10-11 00:23:41,563 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-10-11 00:23:41,563 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-11 00:23:41,563 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-11 00:23:41,564 INFO L382 AbstractCegarLoop]: Difference is false
[2021-10-11 00:23:41,564 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-11 00:23:41,564 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-10-11 00:23:41,582 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-10-11 00:23:41,584 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 254 flow
[2021-10-11 00:23:41,587 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 254 flow
[2021-10-11 00:23:41,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow
[2021-10-11 00:23:41,670 INFO L129 PetriNetUnfolder]: 2/113 cut-off events.
[2021-10-11 00:23:41,670 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-11 00:23:41,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place.
[2021-10-11 00:23:41,682 INFO L116 LiptonReduction]: Number of co-enabled transitions 2598
[2021-10-11 00:23:42,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:42,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:42,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,073 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:42,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:23:42,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:42,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,171 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:42,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:42,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,427 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 230 DAG size of output: 190
[2021-10-11 00:23:44,333 WARN L197 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187
[2021-10-11 00:23:46,279 WARN L197 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 314 DAG size of output: 270
[2021-10-11 00:23:47,143 WARN L197 SmtUtils]: Spent 861.00 ms on a formula simplification that was a NOOP. DAG size: 267
[2021-10-11 00:23:47,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:47,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:47,515 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-10-11 00:23:47,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:47,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:47,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:47,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:47,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:47,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:47,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,671 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:47,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:47,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,719 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:47,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:47,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:47,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:47,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:47,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:47,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:48,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:48,022 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-10-11 00:23:48,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:48,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:48,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:48,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,448 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:48,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:48,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:48,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:48,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:48,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:48,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:48,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:48,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,672 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:48,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:48,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,854 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:48,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,856 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:48,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:48,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:48,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:48,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:48,980 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:48,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:48,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:48,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:48,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:48,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:48,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:48,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:48,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2021-10-11 00:23:48,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2021-10-11 00:23:48,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:48,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2021-10-11 00:23:48,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:49,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:49,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:49,058 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:49,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:49,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2021-10-11 00:23:49,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:49,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term
[2021-10-11 00:23:49,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:49,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2021-10-11 00:23:49,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:49,514 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-10-11 00:23:49,992 WARN L197 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81
[2021-10-11 00:23:50,129 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 79
[2021-10-11 00:23:50,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:50,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:50,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:50,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:50,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,271 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:50,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,272 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:50,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,314 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:50,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:50,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,437 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:50,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:50,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,466 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:50,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:50,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-10-11 00:23:50,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:50,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:50,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:50,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:50,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:50,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:50,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:50,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:50,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:50,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:50,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:50,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:50,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:50,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:50,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,744 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:50,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:50,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:50,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2021-10-11 00:23:50,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:50,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term
[2021-10-11 00:23:50,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:51,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:51,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2021-10-11 00:23:51,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:51,305 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term
[2021-10-11 00:23:51,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:51,350 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:51,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:51,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:51,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:51,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:51,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:51,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:51,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:51,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:51,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:51,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:51,705 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:23:51,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:51,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:51,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:51,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:51,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:51,728 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:23:51,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:51,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:51,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,863 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:51,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:51,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:51,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:51,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:52,041 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 59
[2021-10-11 00:23:52,143 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 59
[2021-10-11 00:23:52,325 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-10-11 00:23:52,484 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-10-11 00:23:52,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:52,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:52,542 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:52,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:52,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:52,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:52,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:52,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:52,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:52,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:52,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:52,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:52,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:52,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:52,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:52,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:52,743 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:52,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:52,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:52,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:52,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:52,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:52,748 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:23:52,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:52,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:52,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:52,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:52,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:52,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:52,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:52,774 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:23:52,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,062 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:53,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-10-11 00:23:53,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:53,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:53,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:53,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:53,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,358 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:23:53,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,378 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:53,380 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:23:53,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:53,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,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:23:53,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,434 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,438 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:23:53,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,596 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:53,598 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:23:53,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:53,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,619 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:23:53,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,812 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,814 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:53,817 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:23:53,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:53,837 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,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:23:53,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,874 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,875 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,880 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:23:53,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:53,899 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,900 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:53,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:53,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:53,904 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:23:53,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:54,162 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56
[2021-10-11 00:23:54,330 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56
[2021-10-11 00:23:54,895 WARN L197 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 190
[2021-10-11 00:23:55,325 WARN L197 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 190
[2021-10-11 00:23:56,328 WARN L197 SmtUtils]: Spent 999.00 ms on a formula simplification that was a NOOP. DAG size: 270
[2021-10-11 00:23:57,211 WARN L197 SmtUtils]: Spent 881.00 ms on a formula simplification that was a NOOP. DAG size: 270
[2021-10-11 00:23:57,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:57,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:57,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:57,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:57,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:23:57,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:57,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:23:57,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:57,891 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 78
[2021-10-11 00:23:58,022 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 78
[2021-10-11 00:23:58,486 WARN L197 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124
[2021-10-11 00:23:58,703 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 120
[2021-10-11 00:23:59,156 WARN L197 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124
[2021-10-11 00:23:59,367 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 120
[2021-10-11 00:24:00,166 WARN L197 SmtUtils]: Spent 797.00 ms on a formula simplification that was a NOOP. DAG size: 206
[2021-10-11 00:24:01,020 WARN L197 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 206
[2021-10-11 00:24:02,872 WARN L197 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 286
[2021-10-11 00:24:04,829 WARN L197 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 286
[2021-10-11 00:24:04,846 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:24:04,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:04,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:24:04,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:04,876 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:24:04,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:04,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:24:04,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:04,942 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:24:04,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:04,943 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:24:04,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:04,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:24:04,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:04,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:24:04,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,024 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:24:05,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:24:05,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,051 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:24:05,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:24:05,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:24:05,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:24:05,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:24:05,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:24:05,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:24:05,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:24:05,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2021-10-11 00:24:05,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2021-10-11 00:24:05,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:24:05,287 INFO L131 LiptonReduction]: Checked pairs total: 7778
[2021-10-11 00:24:05,287 INFO L133 LiptonReduction]: Total number of compositions: 98
[2021-10-11 00:24:05,293 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow
[2021-10-11 00:24:05,519 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states.
[2021-10-11 00:24:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states.
[2021-10-11 00:24:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2021-10-11 00:24:05,531 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:05,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:05,532 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1566809842, now seen corresponding path program 1 times
[2021-10-11 00:24:05,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:05,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349182677]
[2021-10-11 00:24:05,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:05,881 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:24:05,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349182677]
[2021-10-11 00:24:05,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:05,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:24:05,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977602230]
[2021-10-11 00:24:05,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:24:05,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:24:05,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:24:05,908 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states.
[2021-10-11 00:24:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:06,108 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions.
[2021-10-11 00:24:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:24:06,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2021-10-11 00:24:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:06,163 INFO L225 Difference]: With dead ends: 2602
[2021-10-11 00:24:06,163 INFO L226 Difference]: Without dead ends: 2122
[2021-10-11 00:24:06,165 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:24:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states.
[2021-10-11 00:24:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122.
[2021-10-11 00:24:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states.
[2021-10-11 00:24:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions.
[2021-10-11 00:24:06,361 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9
[2021-10-11 00:24:06,362 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:06,362 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions.
[2021-10-11 00:24:06,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:24:06,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions.
[2021-10-11 00:24:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-10-11 00:24:06,369 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:06,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:06,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-11 00:24:06,369 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:06,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1829199143, now seen corresponding path program 1 times
[2021-10-11 00:24:06,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:06,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017078515]
[2021-10-11 00:24:06,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:06,575 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:24:06,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017078515]
[2021-10-11 00:24:06,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:06,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:24:06,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864387141]
[2021-10-11 00:24:06,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:24:06,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:06,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:24:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:24:06,580 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states.
[2021-10-11 00:24:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:06,625 INFO L93 Difference]: Finished difference Result 2062 states and 7802 transitions.
[2021-10-11 00:24:06,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:24:06,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2021-10-11 00:24:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:06,649 INFO L225 Difference]: With dead ends: 2062
[2021-10-11 00:24:06,649 INFO L226 Difference]: Without dead ends: 2062
[2021-10-11 00:24:06,650 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:24:06,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states.
[2021-10-11 00:24:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062.
[2021-10-11 00:24:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states.
[2021-10-11 00:24:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 7802 transitions.
[2021-10-11 00:24:06,747 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 7802 transitions. Word has length 11
[2021-10-11 00:24:06,748 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:06,748 INFO L481 AbstractCegarLoop]: Abstraction has 2062 states and 7802 transitions.
[2021-10-11 00:24:06,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:24:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 7802 transitions.
[2021-10-11 00:24:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2021-10-11 00:24:06,755 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:06,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:06,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-11 00:24:06,755 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:06,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:06,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1390530482, now seen corresponding path program 1 times
[2021-10-11 00:24:06,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:06,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702051336]
[2021-10-11 00:24:06,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:06,935 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:24:06,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702051336]
[2021-10-11 00:24:06,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:06,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:24:06,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124023263]
[2021-10-11 00:24:06,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:24:06,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:06,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:24:06,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:24:06,936 INFO L87 Difference]: Start difference. First operand 2062 states and 7802 transitions. Second operand 3 states.
[2021-10-11 00:24:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:07,004 INFO L93 Difference]: Finished difference Result 1950 states and 7306 transitions.
[2021-10-11 00:24:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:24:07,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2021-10-11 00:24:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:07,026 INFO L225 Difference]: With dead ends: 1950
[2021-10-11 00:24:07,026 INFO L226 Difference]: Without dead ends: 1950
[2021-10-11 00:24:07,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:24:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states.
[2021-10-11 00:24:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1950.
[2021-10-11 00:24:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states.
[2021-10-11 00:24:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 7306 transitions.
[2021-10-11 00:24:07,115 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 7306 transitions. Word has length 12
[2021-10-11 00:24:07,115 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:07,116 INFO L481 AbstractCegarLoop]: Abstraction has 1950 states and 7306 transitions.
[2021-10-11 00:24:07,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:24:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 7306 transitions.
[2021-10-11 00:24:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2021-10-11 00:24:07,119 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:07,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:07,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-11 00:24:07,119 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:07,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:07,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1456415583, now seen corresponding path program 1 times
[2021-10-11 00:24:07,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:07,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648558863]
[2021-10-11 00:24:07,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:07,350 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:24:07,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648558863]
[2021-10-11 00:24:07,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:07,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:24:07,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266348328]
[2021-10-11 00:24:07,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:24:07,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:07,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:24:07,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:24:07,353 INFO L87 Difference]: Start difference. First operand 1950 states and 7306 transitions. Second operand 5 states.
[2021-10-11 00:24:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:07,520 INFO L93 Difference]: Finished difference Result 1866 states and 6962 transitions.
[2021-10-11 00:24:07,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:24:07,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2021-10-11 00:24:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:07,541 INFO L225 Difference]: With dead ends: 1866
[2021-10-11 00:24:07,541 INFO L226 Difference]: Without dead ends: 1866
[2021-10-11 00:24:07,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:24:07,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states.
[2021-10-11 00:24:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866.
[2021-10-11 00:24:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states.
[2021-10-11 00:24:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 6962 transitions.
[2021-10-11 00:24:07,618 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 6962 transitions. Word has length 14
[2021-10-11 00:24:07,619 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:07,619 INFO L481 AbstractCegarLoop]: Abstraction has 1866 states and 6962 transitions.
[2021-10-11 00:24:07,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:24:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 6962 transitions.
[2021-10-11 00:24:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-10-11 00:24:07,623 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:07,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:07,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-11 00:24:07,624 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:07,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:07,624 INFO L82 PathProgramCache]: Analyzing trace with hash 511407601, now seen corresponding path program 1 times
[2021-10-11 00:24:07,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:07,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169271999]
[2021-10-11 00:24:07,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:07,782 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:24:07,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169271999]
[2021-10-11 00:24:07,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:07,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:24:07,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778297662]
[2021-10-11 00:24:07,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:24:07,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:07,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:24:07,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:24:07,784 INFO L87 Difference]: Start difference. First operand 1866 states and 6962 transitions. Second operand 5 states.
[2021-10-11 00:24:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:07,894 INFO L93 Difference]: Finished difference Result 2026 states and 7618 transitions.
[2021-10-11 00:24:07,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:24:07,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2021-10-11 00:24:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:07,916 INFO L225 Difference]: With dead ends: 2026
[2021-10-11 00:24:07,916 INFO L226 Difference]: Without dead ends: 2026
[2021-10-11 00:24:07,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:24:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states.
[2021-10-11 00:24:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026.
[2021-10-11 00:24:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states.
[2021-10-11 00:24:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 7618 transitions.
[2021-10-11 00:24:07,999 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 7618 transitions. Word has length 16
[2021-10-11 00:24:07,999 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:08,000 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 7618 transitions.
[2021-10-11 00:24:08,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:24:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 7618 transitions.
[2021-10-11 00:24:08,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-10-11 00:24:08,004 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:08,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:08,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-11 00:24:08,005 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:08,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:08,005 INFO L82 PathProgramCache]: Analyzing trace with hash 543935281, now seen corresponding path program 2 times
[2021-10-11 00:24:08,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:08,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625442541]
[2021-10-11 00:24:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:08,129 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:24:08,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625442541]
[2021-10-11 00:24:08,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:08,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:24:08,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758084452]
[2021-10-11 00:24:08,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:24:08,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:24:08,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:24:08,132 INFO L87 Difference]: Start difference. First operand 2026 states and 7618 transitions. Second operand 6 states.
[2021-10-11 00:24:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:08,237 INFO L93 Difference]: Finished difference Result 2074 states and 7786 transitions.
[2021-10-11 00:24:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:24:08,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2021-10-11 00:24:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:08,260 INFO L225 Difference]: With dead ends: 2074
[2021-10-11 00:24:08,260 INFO L226 Difference]: Without dead ends: 2074
[2021-10-11 00:24:08,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:24:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states.
[2021-10-11 00:24:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2010.
[2021-10-11 00:24:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states.
[2021-10-11 00:24:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 7562 transitions.
[2021-10-11 00:24:08,341 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 7562 transitions. Word has length 16
[2021-10-11 00:24:08,342 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:08,342 INFO L481 AbstractCegarLoop]: Abstraction has 2010 states and 7562 transitions.
[2021-10-11 00:24:08,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:24:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 7562 transitions.
[2021-10-11 00:24:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-10-11 00:24:08,346 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:08,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:08,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-11 00:24:08,347 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash -150251111, now seen corresponding path program 3 times
[2021-10-11 00:24:08,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:08,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073278818]
[2021-10-11 00:24:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:08,598 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:24:08,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073278818]
[2021-10-11 00:24:08,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:08,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:24:08,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651439438]
[2021-10-11 00:24:08,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:24:08,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:24:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:24:08,607 INFO L87 Difference]: Start difference. First operand 2010 states and 7562 transitions. Second operand 5 states.
[2021-10-11 00:24:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:08,735 INFO L93 Difference]: Finished difference Result 2394 states and 8928 transitions.
[2021-10-11 00:24:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:24:08,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2021-10-11 00:24:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:08,775 INFO L225 Difference]: With dead ends: 2394
[2021-10-11 00:24:08,775 INFO L226 Difference]: Without dead ends: 2394
[2021-10-11 00:24:08,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:24:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states.
[2021-10-11 00:24:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2222.
[2021-10-11 00:24:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states.
[2021-10-11 00:24:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 8246 transitions.
[2021-10-11 00:24:08,878 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 8246 transitions. Word has length 16
[2021-10-11 00:24:08,878 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:08,878 INFO L481 AbstractCegarLoop]: Abstraction has 2222 states and 8246 transitions.
[2021-10-11 00:24:08,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:24:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 8246 transitions.
[2021-10-11 00:24:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-10-11 00:24:08,886 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:08,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:08,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-11 00:24:08,887 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1238929341, now seen corresponding path program 1 times
[2021-10-11 00:24:08,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:08,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919438251]
[2021-10-11 00:24:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:08,986 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:24:08,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919438251]
[2021-10-11 00:24:08,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:08,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:24:08,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595524349]
[2021-10-11 00:24:08,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:24:08,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:24:08,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:24:08,990 INFO L87 Difference]: Start difference. First operand 2222 states and 8246 transitions. Second operand 4 states.
[2021-10-11 00:24:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:09,053 INFO L93 Difference]: Finished difference Result 2356 states and 7980 transitions.
[2021-10-11 00:24:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:24:09,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2021-10-11 00:24:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:09,062 INFO L225 Difference]: With dead ends: 2356
[2021-10-11 00:24:09,062 INFO L226 Difference]: Without dead ends: 1748
[2021-10-11 00:24:09,062 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:24:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states.
[2021-10-11 00:24:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1748.
[2021-10-11 00:24:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states.
[2021-10-11 00:24:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 5876 transitions.
[2021-10-11 00:24:09,122 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 5876 transitions. Word has length 16
[2021-10-11 00:24:09,122 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:09,122 INFO L481 AbstractCegarLoop]: Abstraction has 1748 states and 5876 transitions.
[2021-10-11 00:24:09,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:24:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 5876 transitions.
[2021-10-11 00:24:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-10-11 00:24:09,126 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:09,126 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:24:09,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-11 00:24:09,126 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:09,127 INFO L82 PathProgramCache]: Analyzing trace with hash -247945249, now seen corresponding path program 1 times
[2021-10-11 00:24:09,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:09,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439149390]
[2021-10-11 00:24:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:09,237 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:24:09,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439149390]
[2021-10-11 00:24:09,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:09,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:24:09,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744091469]
[2021-10-11 00:24:09,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:24:09,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:09,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:24:09,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:24:09,239 INFO L87 Difference]: Start difference. First operand 1748 states and 5876 transitions. Second operand 5 states.
[2021-10-11 00:24:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:09,313 INFO L93 Difference]: Finished difference Result 1533 states and 4733 transitions.
[2021-10-11 00:24:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:24:09,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2021-10-11 00:24:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:09,319 INFO L225 Difference]: With dead ends: 1533
[2021-10-11 00:24:09,319 INFO L226 Difference]: Without dead ends: 1141
[2021-10-11 00:24:09,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:24:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states.
[2021-10-11 00:24:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141.
[2021-10-11 00:24:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141 states.
[2021-10-11 00:24:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 3448 transitions.
[2021-10-11 00:24:09,361 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 3448 transitions. Word has length 17
[2021-10-11 00:24:09,362 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:09,362 INFO L481 AbstractCegarLoop]: Abstraction has 1141 states and 3448 transitions.
[2021-10-11 00:24:09,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:24:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 3448 transitions.
[2021-10-11 00:24:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2021-10-11 00:24:09,365 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:09,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:09,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-11 00:24:09,366 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash -50960848, now seen corresponding path program 1 times
[2021-10-11 00:24:09,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:09,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187937146]
[2021-10-11 00:24:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:24:09,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187937146]
[2021-10-11 00:24:09,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:09,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:24:09,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289903448]
[2021-10-11 00:24:09,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:24:09,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:09,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:24:09,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:24:09,492 INFO L87 Difference]: Start difference. First operand 1141 states and 3448 transitions. Second operand 4 states.
[2021-10-11 00:24:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:09,523 INFO L93 Difference]: Finished difference Result 1530 states and 4529 transitions.
[2021-10-11 00:24:09,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-11 00:24:09,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19
[2021-10-11 00:24:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:09,530 INFO L225 Difference]: With dead ends: 1530
[2021-10-11 00:24:09,530 INFO L226 Difference]: Without dead ends: 1000
[2021-10-11 00:24:09,531 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:24:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states.
[2021-10-11 00:24:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 979.
[2021-10-11 00:24:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states.
[2021-10-11 00:24:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 2814 transitions.
[2021-10-11 00:24:09,564 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 2814 transitions. Word has length 19
[2021-10-11 00:24:09,564 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:09,564 INFO L481 AbstractCegarLoop]: Abstraction has 979 states and 2814 transitions.
[2021-10-11 00:24:09,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:24:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 2814 transitions.
[2021-10-11 00:24:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2021-10-11 00:24:09,567 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:09,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:09,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-11 00:24:09,567 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1382870722, now seen corresponding path program 1 times
[2021-10-11 00:24:09,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:09,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060694072]
[2021-10-11 00:24:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:09,670 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:24:09,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060694072]
[2021-10-11 00:24:09,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:09,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:24:09,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727703777]
[2021-10-11 00:24:09,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:24:09,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:09,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:24:09,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:24:09,673 INFO L87 Difference]: Start difference. First operand 979 states and 2814 transitions. Second operand 6 states.
[2021-10-11 00:24:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:09,774 INFO L93 Difference]: Finished difference Result 848 states and 2398 transitions.
[2021-10-11 00:24:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:24:09,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2021-10-11 00:24:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:09,778 INFO L225 Difference]: With dead ends: 848
[2021-10-11 00:24:09,778 INFO L226 Difference]: Without dead ends: 738
[2021-10-11 00:24:09,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:24:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states.
[2021-10-11 00:24:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738.
[2021-10-11 00:24:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states.
[2021-10-11 00:24:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2117 transitions.
[2021-10-11 00:24:09,802 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2117 transitions. Word has length 19
[2021-10-11 00:24:09,802 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:09,802 INFO L481 AbstractCegarLoop]: Abstraction has 738 states and 2117 transitions.
[2021-10-11 00:24:09,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:24:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2117 transitions.
[2021-10-11 00:24:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2021-10-11 00:24:09,805 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:09,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:09,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-10-11 00:24:09,805 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash 754645502, now seen corresponding path program 1 times
[2021-10-11 00:24:09,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:09,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609176775]
[2021-10-11 00:24:09,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:09,885 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:24:09,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609176775]
[2021-10-11 00:24:09,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:09,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:24:09,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288983224]
[2021-10-11 00:24:09,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:24:09,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:24:09,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:24:09,887 INFO L87 Difference]: Start difference. First operand 738 states and 2117 transitions. Second operand 3 states.
[2021-10-11 00:24:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:09,904 INFO L93 Difference]: Finished difference Result 1007 states and 2796 transitions.
[2021-10-11 00:24:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:24:09,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22
[2021-10-11 00:24:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:09,908 INFO L225 Difference]: With dead ends: 1007
[2021-10-11 00:24:09,908 INFO L226 Difference]: Without dead ends: 676
[2021-10-11 00:24:09,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:24:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states.
[2021-10-11 00:24:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 638.
[2021-10-11 00:24:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states.
[2021-10-11 00:24:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1687 transitions.
[2021-10-11 00:24:09,927 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1687 transitions. Word has length 22
[2021-10-11 00:24:09,928 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:09,928 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 1687 transitions.
[2021-10-11 00:24:09,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:24:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1687 transitions.
[2021-10-11 00:24:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2021-10-11 00:24:09,930 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:09,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:09,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-10-11 00:24:09,931 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:09,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:09,931 INFO L82 PathProgramCache]: Analyzing trace with hash 192906558, now seen corresponding path program 2 times
[2021-10-11 00:24:09,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:09,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343565824]
[2021-10-11 00:24:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:10,042 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:24:10,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343565824]
[2021-10-11 00:24:10,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:10,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-11 00:24:10,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253795420]
[2021-10-11 00:24:10,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-10-11 00:24:10,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-11 00:24:10,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:24:10,044 INFO L87 Difference]: Start difference. First operand 638 states and 1687 transitions. Second operand 7 states.
[2021-10-11 00:24:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:10,133 INFO L93 Difference]: Finished difference Result 611 states and 1633 transitions.
[2021-10-11 00:24:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-10-11 00:24:10,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22
[2021-10-11 00:24:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:10,135 INFO L225 Difference]: With dead ends: 611
[2021-10-11 00:24:10,136 INFO L226 Difference]: Without dead ends: 228
[2021-10-11 00:24:10,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2021-10-11 00:24:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states.
[2021-10-11 00:24:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 184.
[2021-10-11 00:24:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states.
[2021-10-11 00:24:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 454 transitions.
[2021-10-11 00:24:10,143 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 454 transitions. Word has length 22
[2021-10-11 00:24:10,143 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:10,143 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 454 transitions.
[2021-10-11 00:24:10,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-10-11 00:24:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 454 transitions.
[2021-10-11 00:24:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2021-10-11 00:24:10,144 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:10,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:10,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-10-11 00:24:10,145 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:10,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:10,145 INFO L82 PathProgramCache]: Analyzing trace with hash -277081058, now seen corresponding path program 1 times
[2021-10-11 00:24:10,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:10,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621329201]
[2021-10-11 00:24:10,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:10,229 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:24:10,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621329201]
[2021-10-11 00:24:10,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:10,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:24:10,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187132502]
[2021-10-11 00:24:10,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:24:10,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:10,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:24:10,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:24:10,231 INFO L87 Difference]: Start difference. First operand 184 states and 454 transitions. Second operand 4 states.
[2021-10-11 00:24:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:10,252 INFO L93 Difference]: Finished difference Result 234 states and 572 transitions.
[2021-10-11 00:24:10,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-11 00:24:10,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26
[2021-10-11 00:24:10,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:10,254 INFO L225 Difference]: With dead ends: 234
[2021-10-11 00:24:10,254 INFO L226 Difference]: Without dead ends: 92
[2021-10-11 00:24:10,254 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:24:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2021-10-11 00:24:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2021-10-11 00:24:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states.
[2021-10-11 00:24:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions.
[2021-10-11 00:24:10,258 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 26
[2021-10-11 00:24:10,258 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:10,258 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions.
[2021-10-11 00:24:10,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:24:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions.
[2021-10-11 00:24:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2021-10-11 00:24:10,259 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:10,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:10,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-10-11 00:24:10,259 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:10,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:10,260 INFO L82 PathProgramCache]: Analyzing trace with hash -484054926, now seen corresponding path program 2 times
[2021-10-11 00:24:10,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:10,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553687375]
[2021-10-11 00:24:10,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:24:10,459 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:24:10,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553687375]
[2021-10-11 00:24:10,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:24:10,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:24:10,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981554175]
[2021-10-11 00:24:10,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-10-11 00:24:10,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:24:10,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-11 00:24:10,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:24:10,461 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand 7 states.
[2021-10-11 00:24:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:24:10,540 INFO L93 Difference]: Finished difference Result 118 states and 252 transitions.
[2021-10-11 00:24:10,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:24:10,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26
[2021-10-11 00:24:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:24:10,542 INFO L225 Difference]: With dead ends: 118
[2021-10-11 00:24:10,542 INFO L226 Difference]: Without dead ends: 64
[2021-10-11 00:24:10,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:24:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2021-10-11 00:24:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64.
[2021-10-11 00:24:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states.
[2021-10-11 00:24:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions.
[2021-10-11 00:24:10,544 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26
[2021-10-11 00:24:10,544 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:24:10,544 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions.
[2021-10-11 00:24:10,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-10-11 00:24:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions.
[2021-10-11 00:24:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2021-10-11 00:24:10,545 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:24:10,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:24:10,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-10-11 00:24:10,545 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:24:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:24:10,546 INFO L82 PathProgramCache]: Analyzing trace with hash -772400604, now seen corresponding path program 3 times
[2021-10-11 00:24:10,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:24:10,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490446166]
[2021-10-11 00:24:10,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:24:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:24:10,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:24:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:24:10,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:24:10,671 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-11 00:24:10,676 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2021-10-11 00:24:10,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-10-11 00:24:10,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:24:10 BasicIcfg
[2021-10-11 00:24:10,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-11 00:24:10,822 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-11 00:24:10,822 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-10-11 00:24:10,832 INFO L275 PluginConnector]: Witness Printer initialized
[2021-10-11 00:24:10,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:23:41" (3/4) ...
[2021-10-11 00:24:10,834 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-11 00:24:10,942 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b12362e0-2547-4af8-aeb0-beed18648ffd/bin/uautomizer-Z5i5R5N3CC/witness.graphml
[2021-10-11 00:24:10,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-11 00:24:10,944 INFO L168 Benchmark]: Toolchain (without parser) took 33028.14 ms. Allocated memory was 98.6 MB in the beginning and 377.5 MB in the end (delta: 278.9 MB). Free memory was 57.7 MB in the beginning and 131.3 MB in the end (delta: -73.7 MB). Peak memory consumption was 204.4 MB. Max. memory is 16.1 GB.
[2021-10-11 00:24:10,944 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 98.6 MB. Free memory is still 75.4 MB. There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-11 00:24:10,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.50 ms. Allocated memory is still 98.6 MB. Free memory was 57.5 MB in the beginning and 48.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB.
[2021-10-11 00:24:10,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.53 ms. Allocated memory is still 98.6 MB. Free memory was 48.3 MB in the beginning and 45.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:24:10,945 INFO L168 Benchmark]: Boogie Preprocessor took 36.91 ms. Allocated memory is still 98.6 MB. Free memory was 45.5 MB in the beginning and 43.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:24:10,946 INFO L168 Benchmark]: RCFGBuilder took 2663.10 ms. Allocated memory was 98.6 MB in the beginning and 146.8 MB in the end (delta: 48.2 MB). Free memory was 43.1 MB in the beginning and 85.5 MB in the end (delta: -42.4 MB). Peak memory consumption was 37.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:24:10,946 INFO L168 Benchmark]: TraceAbstraction took 29427.00 ms. Allocated memory was 146.8 MB in the beginning and 377.5 MB in the end (delta: 230.7 MB). Free memory was 85.5 MB in the beginning and 149.2 MB in the end (delta: -63.7 MB). Peak memory consumption was 166.9 MB. Max. memory is 16.1 GB.
[2021-10-11 00:24:10,947 INFO L168 Benchmark]: Witness Printer took 120.69 ms. Allocated memory is still 377.5 MB. Free memory was 149.2 MB in the beginning and 131.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
[2021-10-11 00:24:10,949 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.52 ms. Allocated memory is still 98.6 MB. Free memory is still 75.4 MB. There was no memory consumed. Max. memory is 16.1 GB.
* CACSL2BoogieTranslator took 711.50 ms. Allocated memory is still 98.6 MB. Free memory was 57.5 MB in the beginning and 48.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB.
* Boogie Procedure Inliner took 57.53 ms. Allocated memory is still 98.6 MB. Free memory was 48.3 MB in the beginning and 45.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* Boogie Preprocessor took 36.91 ms. Allocated memory is still 98.6 MB. Free memory was 45.5 MB in the beginning and 43.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* RCFGBuilder took 2663.10 ms. Allocated memory was 98.6 MB in the beginning and 146.8 MB in the end (delta: 48.2 MB). Free memory was 43.1 MB in the beginning and 85.5 MB in the end (delta: -42.4 MB). Peak memory consumption was 37.1 MB. Max. memory is 16.1 GB.
* TraceAbstraction took 29427.00 ms. Allocated memory was 146.8 MB in the beginning and 377.5 MB in the end (delta: 230.7 MB). Free memory was 85.5 MB in the beginning and 149.2 MB in the end (delta: -63.7 MB). Peak memory consumption was 166.9 MB. Max. memory is 16.1 GB.
* Witness Printer took 120.69 ms. Allocated memory is still 377.5 MB. Free memory was 149.2 MB in the beginning and 131.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1770 VarBasedMoverChecksPositive, 90 VarBasedMoverChecksNegative, 30 SemBasedMoverChecksPositive, 60 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.3s, 214 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 23.7s, 128 PlacesBefore, 45 PlacesAfterwards, 117 TransitionsBefore, 33 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 8 FixpointIterations, 41 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 7778 MoverChecksTotal
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p1_EAX = 0;
[L714] 0 int __unbuffered_p3_EAX = 0;
[L716] 0 int __unbuffered_p3_EBX = 0;
[L718] 0 int a = 0;
[L720] 0 int b = 0;
[L721] 0 _Bool main$tmp_guard0;
[L722] 0 _Bool main$tmp_guard1;
[L724] 0 int x = 0;
[L726] 0 int y = 0;
[L728] 0 int z = 0;
[L729] 0 _Bool z$flush_delayed;
[L730] 0 int z$mem_tmp;
[L731] 0 _Bool z$r_buff0_thd0;
[L732] 0 _Bool z$r_buff0_thd1;
[L733] 0 _Bool z$r_buff0_thd2;
[L734] 0 _Bool z$r_buff0_thd3;
[L735] 0 _Bool z$r_buff0_thd4;
[L736] 0 _Bool z$r_buff1_thd0;
[L737] 0 _Bool z$r_buff1_thd1;
[L738] 0 _Bool z$r_buff1_thd2;
[L739] 0 _Bool z$r_buff1_thd3;
[L740] 0 _Bool z$r_buff1_thd4;
[L741] 0 _Bool z$read_delayed;
[L742] 0 int *z$read_delayed_var;
[L743] 0 int z$w_buff0;
[L744] 0 _Bool z$w_buff0_used;
[L745] 0 int z$w_buff1;
[L746] 0 _Bool z$w_buff1_used;
[L747] 0 _Bool weak$$choice0;
[L748] 0 _Bool weak$$choice2;
[L846] 0 pthread_t t1181;
[L847] FCALL, FORK 0 pthread_create(&t1181, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L848] 0 pthread_t t1182;
[L849] FCALL, FORK 0 pthread_create(&t1182, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L850] 0 pthread_t t1183;
[L851] FCALL, FORK 0 pthread_create(&t1183, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L852] 0 pthread_t t1184;
[L853] FCALL, FORK 0 pthread_create(&t1184, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L802] 4 z$w_buff1 = z$w_buff0
[L803] 4 z$w_buff0 = 2
[L804] 4 z$w_buff1_used = z$w_buff0_used
[L805] 4 z$w_buff0_used = (_Bool)1
[L18] COND FALSE 4 !(!expression)
[L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0
[L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1
[L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2
[L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3
[L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4
[L812] 4 z$r_buff0_thd4 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L815] 4 a = 1
[L818] 4 __unbuffered_p3_EAX = a
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L821] 4 __unbuffered_p3_EBX = b
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L752] 1 b = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L755] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L762] 1 return 0;
[L767] 2 x = 2
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L770] 2 __unbuffered_p1_EAX = y
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L782] 3 y = 1
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L777] 2 return 0;
[L785] 3 z = 1
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L797] 3 return 0;
[L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L833] 4 return 0;
[L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L3] COND FALSE 0 !(!cond)
[L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L866] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L867] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L868] 0 z$flush_delayed = weak$$choice2
[L869] 0 z$mem_tmp = z
[L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)
[L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)
[L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z
[L878] 0 z = z$flush_delayed ? z$mem_tmp : z
[L879] 0 z$flush_delayed = (_Bool)0
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 29.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 23.9s, HoareTripleCheckerStatistics: 511 SDtfs, 516 SDslu, 762 SDs, 0 SdLazy, 313 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 339 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 25398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...