./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 5e519f3a
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc --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 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-5e519f3
[2022-11-02 21:03:40,266 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 21:03:40,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 21:03:40,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 21:03:40,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 21:03:40,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 21:03:40,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 21:03:40,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 21:03:40,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 21:03:40,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 21:03:40,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 21:03:40,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 21:03:40,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 21:03:40,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 21:03:40,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 21:03:40,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 21:03:40,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 21:03:40,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 21:03:40,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 21:03:40,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 21:03:40,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 21:03:40,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 21:03:40,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 21:03:40,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 21:03:40,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 21:03:40,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 21:03:40,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 21:03:40,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 21:03:40,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 21:03:40,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 21:03:40,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 21:03:40,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 21:03:40,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 21:03:40,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 21:03:40,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 21:03:40,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 21:03:40,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 21:03:40,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 21:03:40,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 21:03:40,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 21:03:40,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 21:03:40,403 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-11-02 21:03:40,444 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 21:03:40,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 21:03:40,445 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 21:03:40,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 21:03:40,446 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 21:03:40,447 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 21:03:40,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 21:03:40,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 21:03:40,448 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 21:03:40,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 21:03:40,449 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-02 21:03:40,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-02 21:03:40,450 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-02 21:03:40,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 21:03:40,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 21:03:40,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 21:03:40,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 21:03:40,451 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-02 21:03:40,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 21:03:40,452 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 21:03:40,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 21:03:40,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 21:03:40,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 21:03:40,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 21:03:40,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 21:03:40,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 21:03:40,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 21:03:40,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 21:03:40,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-02 21:03:40,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-02 21:03:40,456 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 21:03:40,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 21:03:40,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 21:03:40,457 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_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/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_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc
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 -> 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce
[2022-11-02 21:03:40,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 21:03:40,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 21:03:40,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 21:03:40,796 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 21:03:40,797 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 21:03:40,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i
[2022-11-02 21:03:40,884 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/data/ba1ef1f2c/dd8a1069b310470cad8c2ac3ffb1ba2f/FLAG21eda059e
[2022-11-02 21:03:41,529 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 21:03:41,530 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i
[2022-11-02 21:03:41,559 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/data/ba1ef1f2c/dd8a1069b310470cad8c2ac3ffb1ba2f/FLAG21eda059e
[2022-11-02 21:03:41,769 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/data/ba1ef1f2c/dd8a1069b310470cad8c2ac3ffb1ba2f
[2022-11-02 21:03:41,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 21:03:41,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 21:03:41,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 21:03:41,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 21:03:41,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 21:03:41,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:03:41" (1/1) ...
[2022-11-02 21:03:41,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582a900b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:41, skipping insertion in model container
[2022-11-02 21:03:41,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:03:41" (1/1) ...
[2022-11-02 21:03:41,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 21:03:41,860 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 21:03:42,106 WARN L230 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_8df4a016-b13a-4190-a8d5-55e40aaac173/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i[999,1012]
[2022-11-02 21:03:42,315 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 21:03:42,332 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 21:03:42,352 WARN L230 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_8df4a016-b13a-4190-a8d5-55e40aaac173/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i[999,1012]
[2022-11-02 21:03:42,443 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 21:03:42,469 INFO L208 MainTranslator]: Completed translation
[2022-11-02 21:03:42,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42 WrapperNode
[2022-11-02 21:03:42,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 21:03:42,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 21:03:42,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 21:03:42,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 21:03:42,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,537 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169
[2022-11-02 21:03:42,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 21:03:42,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 21:03:42,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 21:03:42,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 21:03:42,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,594 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 21:03:42,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 21:03:42,615 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 21:03:42,615 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 21:03:42,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (1/1) ...
[2022-11-02 21:03:42,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 21:03:42,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 21:03:42,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 21:03:42,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 21:03:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-11-02 21:03:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-11-02 21:03:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 21:03:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-11-02 21:03:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-11-02 21:03:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2022-11-02 21:03:42,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2022-11-02 21:03:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2022-11-02 21:03:42,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2022-11-02 21:03:42,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-02 21:03:42,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-11-02 21:03:42,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 21:03:42,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 21:03:42,711 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-11-02 21:03:42,852 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 21:03:42,854 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 21:03:43,622 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 21:03:43,965 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 21:03:43,966 INFO L300 CfgBuilder]: Removed 0 assume(true) statements.
[2022-11-02 21:03:43,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:43 BoogieIcfgContainer
[2022-11-02 21:03:43,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 21:03:43,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 21:03:43,971 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 21:03:43,975 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 21:03:43,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:03:41" (1/3) ...
[2022-11-02 21:03:43,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b40dba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:03:43, skipping insertion in model container
[2022-11-02 21:03:43,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:42" (2/3) ...
[2022-11-02 21:03:43,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b40dba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:03:43, skipping insertion in model container
[2022-11-02 21:03:43,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:43" (3/3) ...
[2022-11-02 21:03:43,979 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i
[2022-11-02 21:03:43,990 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-11-02 21:03:44,001 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 21:03:44,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-11-02 21:03:44,001 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-11-02 21:03:44,079 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-11-02 21:03:44,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow
[2022-11-02 21:03:44,161 INFO L130 PetriNetUnfolder]: 2/96 cut-off events.
[2022-11-02 21:03:44,162 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-02 21:03:44,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place.
[2022-11-02 21:03:44,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow
[2022-11-02 21:03:44,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow
[2022-11-02 21:03:44,180 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 21:03:44,186 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61e86d69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 21:03:44,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2022-11-02 21:03:44,201 INFO L130 PetriNetUnfolder]: 0/58 cut-off events.
[2022-11-02 21:03:44,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-02 21:03:44,202 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 21:03:44,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 21:03:44,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2022-11-02 21:03:44,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 21:03:44,208 INFO L85 PathProgramCache]: Analyzing trace with hash 119522127, now seen corresponding path program 1 times
[2022-11-02 21:03:44,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 21:03:44,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327017416]
[2022-11-02 21:03:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 21:03:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 21:03:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 21:03:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 21:03:44,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 21:03:44,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327017416]
[2022-11-02 21:03:44,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327017416] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 21:03:44,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 21:03:44,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 21:03:44,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384957349]
[2022-11-02 21:03:44,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 21:03:44,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 21:03:44,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 21:03:44,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 21:03:44,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 21:03:44,865 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 98
[2022-11-02 21:03:44,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:44,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 21:03:44,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 98
[2022-11-02 21:03:44,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 21:03:44,997 INFO L130 PetriNetUnfolder]: 10/162 cut-off events.
[2022-11-02 21:03:45,000 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2022-11-02 21:03:45,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 162 events. 10/162 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 339 event pairs, 4 based on Foata normal form. 6/159 useless extension candidates. Maximal degree in co-relation 147. Up to 17 conditions per place.
[2022-11-02 21:03:45,005 INFO L137 encePairwiseOnDemand]: 93/98 looper letters, 7 selfloop transitions, 2 changer transitions 0/94 dead transitions.
[2022-11-02 21:03:45,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 212 flow
[2022-11-02 21:03:45,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 21:03:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 21:03:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions.
[2022-11-02 21:03:45,039 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.935374149659864
[2022-11-02 21:03:45,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions.
[2022-11-02 21:03:45,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions.
[2022-11-02 21:03:45,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 21:03:45,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions.
[2022-11-02 21:03:45,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:45,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:45,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:45,067 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 275 transitions.
[2022-11-02 21:03:45,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 212 flow
[2022-11-02 21:03:45,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 21:03:45,075 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 192 flow
[2022-11-02 21:03:45,077 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=99, PETRI_TRANSITIONS=92}
[2022-11-02 21:03:45,084 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places.
[2022-11-02 21:03:45,084 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 192 flow
[2022-11-02 21:03:45,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:45,085 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 21:03:45,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 21:03:45,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-02 21:03:45,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2022-11-02 21:03:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 21:03:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash -252737712, now seen corresponding path program 1 times
[2022-11-02 21:03:45,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 21:03:45,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909124630]
[2022-11-02 21:03:45,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 21:03:45,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 21:03:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 21:03:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 21:03:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 21:03:45,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909124630]
[2022-11-02 21:03:45,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909124630] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 21:03:45,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 21:03:45,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 21:03:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113929251]
[2022-11-02 21:03:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 21:03:45,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 21:03:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 21:03:45,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 21:03:45,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 21:03:45,522 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 98
[2022-11-02 21:03:45,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:45,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 21:03:45,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 98
[2022-11-02 21:03:45,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 21:03:46,009 INFO L130 PetriNetUnfolder]: 84/381 cut-off events.
[2022-11-02 21:03:46,009 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES.
[2022-11-02 21:03:46,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 381 events. 84/381 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1838 event pairs, 18 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 522. Up to 65 conditions per place.
[2022-11-02 21:03:46,017 INFO L137 encePairwiseOnDemand]: 92/98 looper letters, 14 selfloop transitions, 2 changer transitions 34/118 dead transitions.
[2022-11-02 21:03:46,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 118 transitions, 332 flow
[2022-11-02 21:03:46,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 21:03:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-11-02 21:03:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 754 transitions.
[2022-11-02 21:03:46,024 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.854875283446712
[2022-11-02 21:03:46,024 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 754 transitions.
[2022-11-02 21:03:46,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 754 transitions.
[2022-11-02 21:03:46,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 21:03:46,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 754 transitions.
[2022-11-02 21:03:46,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.77777777777777) internal successors, (754), 9 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:46,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:46,033 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:46,033 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 192 flow. Second operand 9 states and 754 transitions.
[2022-11-02 21:03:46,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 118 transitions, 332 flow
[2022-11-02 21:03:46,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-11-02 21:03:46,039 INFO L231 Difference]: Finished difference. Result has 112 places, 82 transitions, 188 flow
[2022-11-02 21:03:46,039 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=112, PETRI_TRANSITIONS=82}
[2022-11-02 21:03:46,040 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places.
[2022-11-02 21:03:46,040 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 188 flow
[2022-11-02 21:03:46,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:46,041 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 21:03:46,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 21:03:46,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-02 21:03:46,042 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2022-11-02 21:03:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 21:03:46,044 INFO L85 PathProgramCache]: Analyzing trace with hash 110690063, now seen corresponding path program 1 times
[2022-11-02 21:03:46,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 21:03:46,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746362030]
[2022-11-02 21:03:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 21:03:46,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 21:03:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 21:03:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 21:03:46,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 21:03:46,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746362030]
[2022-11-02 21:03:46,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746362030] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 21:03:46,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 21:03:46,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-11-02 21:03:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719929601]
[2022-11-02 21:03:46,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 21:03:46,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-11-02 21:03:46,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 21:03:46,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-11-02 21:03:46,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-11-02 21:03:46,380 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 98
[2022-11-02 21:03:46,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:46,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 21:03:46,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 98
[2022-11-02 21:03:46,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 21:03:46,719 INFO L130 PetriNetUnfolder]: 122/390 cut-off events.
[2022-11-02 21:03:46,720 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES.
[2022-11-02 21:03:46,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 390 events. 122/390 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1792 event pairs, 10 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 661. Up to 67 conditions per place.
[2022-11-02 21:03:46,723 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 21 selfloop transitions, 5 changer transitions 35/127 dead transitions.
[2022-11-02 21:03:46,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 127 transitions, 402 flow
[2022-11-02 21:03:46,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-02 21:03:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-11-02 21:03:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 843 transitions.
[2022-11-02 21:03:46,727 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.860204081632653
[2022-11-02 21:03:46,727 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 843 transitions.
[2022-11-02 21:03:46,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 843 transitions.
[2022-11-02 21:03:46,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 21:03:46,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 843 transitions.
[2022-11-02 21:03:46,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:46,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:46,734 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:46,734 INFO L175 Difference]: Start difference. First operand has 112 places, 82 transitions, 188 flow. Second operand 10 states and 843 transitions.
[2022-11-02 21:03:46,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 127 transitions, 402 flow
[2022-11-02 21:03:46,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 127 transitions, 386 flow, removed 6 selfloop flow, removed 8 redundant places.
[2022-11-02 21:03:46,740 INFO L231 Difference]: Finished difference. Result has 103 places, 83 transitions, 214 flow
[2022-11-02 21:03:46,740 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=103, PETRI_TRANSITIONS=83}
[2022-11-02 21:03:46,743 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places.
[2022-11-02 21:03:46,743 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 214 flow
[2022-11-02 21:03:46,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:46,745 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 21:03:46,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 21:03:46,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-02 21:03:46,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2022-11-02 21:03:46,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 21:03:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1638692264, now seen corresponding path program 1 times
[2022-11-02 21:03:46,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 21:03:46,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401554766]
[2022-11-02 21:03:46,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 21:03:46,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 21:03:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 21:03:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 21:03:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 21:03:47,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401554766]
[2022-11-02 21:03:47,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401554766] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 21:03:47,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 21:03:47,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-02 21:03:47,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811981245]
[2022-11-02 21:03:47,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 21:03:47,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-02 21:03:47,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 21:03:47,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-02 21:03:47,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-11-02 21:03:47,118 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 98
[2022-11-02 21:03:47,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:47,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 21:03:47,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 98
[2022-11-02 21:03:47,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 21:03:47,356 INFO L130 PetriNetUnfolder]: 27/163 cut-off events.
[2022-11-02 21:03:47,356 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES.
[2022-11-02 21:03:47,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 163 events. 27/163 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 403 event pairs, 3 based on Foata normal form. 6/167 useless extension candidates. Maximal degree in co-relation 318. Up to 24 conditions per place.
[2022-11-02 21:03:47,357 INFO L137 encePairwiseOnDemand]: 90/98 looper letters, 14 selfloop transitions, 7 changer transitions 17/104 dead transitions.
[2022-11-02 21:03:47,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 104 transitions, 377 flow
[2022-11-02 21:03:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-11-02 21:03:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-11-02 21:03:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 820 transitions.
[2022-11-02 21:03:47,360 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511
[2022-11-02 21:03:47,361 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 820 transitions.
[2022-11-02 21:03:47,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 820 transitions.
[2022-11-02 21:03:47,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 21:03:47,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 820 transitions.
[2022-11-02 21:03:47,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.0) internal successors, (820), 10 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:47,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:47,371 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:47,371 INFO L175 Difference]: Start difference. First operand has 103 places, 83 transitions, 214 flow. Second operand 10 states and 820 transitions.
[2022-11-02 21:03:47,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 104 transitions, 377 flow
[2022-11-02 21:03:47,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 338 flow, removed 14 selfloop flow, removed 6 redundant places.
[2022-11-02 21:03:47,377 INFO L231 Difference]: Finished difference. Result has 106 places, 83 transitions, 226 flow
[2022-11-02 21:03:47,377 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=106, PETRI_TRANSITIONS=83}
[2022-11-02 21:03:47,379 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places.
[2022-11-02 21:03:47,379 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 226 flow
[2022-11-02 21:03:47,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:47,382 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 21:03:47,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 21:03:47,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-02 21:03:47,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2022-11-02 21:03:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 21:03:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash 492593562, now seen corresponding path program 1 times
[2022-11-02 21:03:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 21:03:47,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455722361]
[2022-11-02 21:03:47,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 21:03:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 21:03:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 21:03:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 21:03:48,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 21:03:48,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455722361]
[2022-11-02 21:03:48,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455722361] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 21:03:48,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 21:03:48,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-11-02 21:03:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5334814]
[2022-11-02 21:03:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 21:03:48,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-11-02 21:03:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 21:03:48,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-11-02 21:03:48,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2022-11-02 21:03:48,394 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 98
[2022-11-02 21:03:48,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 226 flow. Second operand has 9 states, 9 states have (on average 77.0) internal successors, (693), 9 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:48,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 21:03:48,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 98
[2022-11-02 21:03:48,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 21:03:48,695 INFO L130 PetriNetUnfolder]: 4/146 cut-off events.
[2022-11-02 21:03:48,695 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES.
[2022-11-02 21:03:48,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 146 events. 4/146 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 270 event pairs, 1 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 215. Up to 17 conditions per place.
[2022-11-02 21:03:48,696 INFO L137 encePairwiseOnDemand]: 90/98 looper letters, 22 selfloop transitions, 4 changer transitions 6/97 dead transitions.
[2022-11-02 21:03:48,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 97 transitions, 318 flow
[2022-11-02 21:03:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 21:03:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-11-02 21:03:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 708 transitions.
[2022-11-02 21:03:48,699 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8027210884353742
[2022-11-02 21:03:48,699 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 708 transitions.
[2022-11-02 21:03:48,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 708 transitions.
[2022-11-02 21:03:48,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 21:03:48,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 708 transitions.
[2022-11-02 21:03:48,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.66666666666667) internal successors, (708), 9 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:48,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:48,704 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:48,704 INFO L175 Difference]: Start difference. First operand has 106 places, 83 transitions, 226 flow. Second operand 9 states and 708 transitions.
[2022-11-02 21:03:48,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 97 transitions, 318 flow
[2022-11-02 21:03:48,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 97 transitions, 272 flow, removed 13 selfloop flow, removed 13 redundant places.
[2022-11-02 21:03:48,708 INFO L231 Difference]: Finished difference. Result has 103 places, 85 transitions, 210 flow
[2022-11-02 21:03:48,708 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=103, PETRI_TRANSITIONS=85}
[2022-11-02 21:03:48,709 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places.
[2022-11-02 21:03:48,709 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 210 flow
[2022-11-02 21:03:48,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 77.0) internal successors, (693), 9 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:48,710 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 21:03:48,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 21:03:48,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-02 21:03:48,710 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2022-11-02 21:03:48,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 21:03:48,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1168005580, now seen corresponding path program 2 times
[2022-11-02 21:03:48,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 21:03:48,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527543326]
[2022-11-02 21:03:48,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 21:03:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 21:03:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 21:03:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 21:03:49,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 21:03:49,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527543326]
[2022-11-02 21:03:49,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527543326] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 21:03:49,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 21:03:49,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-11-02 21:03:49,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790784299]
[2022-11-02 21:03:49,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 21:03:49,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-11-02 21:03:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 21:03:49,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-11-02 21:03:49,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-11-02 21:03:49,058 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98
[2022-11-02 21:03:49,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:49,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 21:03:49,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98
[2022-11-02 21:03:49,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 21:03:49,272 INFO L130 PetriNetUnfolder]: 10/173 cut-off events.
[2022-11-02 21:03:49,272 INFO L131 PetriNetUnfolder]: For 24/26 co-relation queries the response was YES.
[2022-11-02 21:03:49,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 173 events. 10/173 cut-off events. For 24/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 419 event pairs, 2 based on Foata normal form. 2/173 useless extension candidates. Maximal degree in co-relation 284. Up to 27 conditions per place.
[2022-11-02 21:03:49,273 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 19 selfloop transitions, 5 changer transitions 10/98 dead transitions.
[2022-11-02 21:03:49,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 98 transitions, 328 flow
[2022-11-02 21:03:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-11-02 21:03:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2022-11-02 21:03:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 624 transitions.
[2022-11-02 21:03:49,276 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388
[2022-11-02 21:03:49,276 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 624 transitions.
[2022-11-02 21:03:49,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 624 transitions.
[2022-11-02 21:03:49,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 21:03:49,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 624 transitions.
[2022-11-02 21:03:49,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.0) internal successors, (624), 8 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:49,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:49,280 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:49,280 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 210 flow. Second operand 8 states and 624 transitions.
[2022-11-02 21:03:49,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 98 transitions, 328 flow
[2022-11-02 21:03:49,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 98 transitions, 308 flow, removed 7 selfloop flow, removed 6 redundant places.
[2022-11-02 21:03:49,283 INFO L231 Difference]: Finished difference. Result has 105 places, 85 transitions, 219 flow
[2022-11-02 21:03:49,284 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=219, PETRI_PLACES=105, PETRI_TRANSITIONS=85}
[2022-11-02 21:03:49,284 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 4 predicate places.
[2022-11-02 21:03:49,284 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 85 transitions, 219 flow
[2022-11-02 21:03:49,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:49,285 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 21:03:49,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 21:03:49,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-11-02 21:03:49,285 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2022-11-02 21:03:49,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 21:03:49,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1429081758, now seen corresponding path program 3 times
[2022-11-02 21:03:49,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 21:03:49,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402393762]
[2022-11-02 21:03:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 21:03:49,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 21:03:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 21:03:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 21:03:49,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 21:03:49,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402393762]
[2022-11-02 21:03:49,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402393762] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 21:03:49,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 21:03:49,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-11-02 21:03:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732323557]
[2022-11-02 21:03:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 21:03:49,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-11-02 21:03:49,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 21:03:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-11-02 21:03:49,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2022-11-02 21:03:49,649 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98
[2022-11-02 21:03:49,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 85 transitions, 219 flow. Second operand has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:49,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 21:03:49,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98
[2022-11-02 21:03:49,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 21:03:49,863 INFO L130 PetriNetUnfolder]: 7/144 cut-off events.
[2022-11-02 21:03:49,863 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES.
[2022-11-02 21:03:49,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 144 events. 7/144 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 278 event pairs, 0 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 237. Up to 19 conditions per place.
[2022-11-02 21:03:49,864 INFO L137 encePairwiseOnDemand]: 90/98 looper letters, 16 selfloop transitions, 3 changer transitions 11/94 dead transitions.
[2022-11-02 21:03:49,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 94 transitions, 309 flow
[2022-11-02 21:03:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-11-02 21:03:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2022-11-02 21:03:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 623 transitions.
[2022-11-02 21:03:49,867 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7946428571428571
[2022-11-02 21:03:49,867 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 623 transitions.
[2022-11-02 21:03:49,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 623 transitions.
[2022-11-02 21:03:49,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 21:03:49,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 623 transitions.
[2022-11-02 21:03:49,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 77.875) internal successors, (623), 8 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:49,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:49,872 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:49,872 INFO L175 Difference]: Start difference. First operand has 105 places, 85 transitions, 219 flow. Second operand 8 states and 623 transitions.
[2022-11-02 21:03:49,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 94 transitions, 309 flow
[2022-11-02 21:03:49,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 94 transitions, 294 flow, removed 5 selfloop flow, removed 5 redundant places.
[2022-11-02 21:03:49,877 INFO L231 Difference]: Finished difference. Result has 107 places, 83 transitions, 208 flow
[2022-11-02 21:03:49,877 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=107, PETRI_TRANSITIONS=83}
[2022-11-02 21:03:49,878 INFO L287 CegarLoopForPetriNet]: 101 programPoint places, 6 predicate places.
[2022-11-02 21:03:49,878 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 83 transitions, 208 flow
[2022-11-02 21:03:49,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 21:03:49,879 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 21:03:49,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 21:03:49,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-11-02 21:03:49,879 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2022-11-02 21:03:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 21:03:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1598153568, now seen corresponding path program 4 times
[2022-11-02 21:03:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 21:03:49,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200972574]
[2022-11-02 21:03:49,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 21:03:49,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 21:03:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 21:03:49,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-02 21:03:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 21:03:50,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-02 21:03:50,034 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-02 21:03:50,039 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2022-11-02 21:03:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2022-11-02 21:03:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2022-11-02 21:03:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2022-11-02 21:03:50,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2022-11-02 21:03:50,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-11-02 21:03:50,045 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1]
[2022-11-02 21:03:50,052 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-11-02 21:03:50,052 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-02 21:03:50,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:03:50 BasicIcfg
[2022-11-02 21:03:50,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-02 21:03:50,190 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-02 21:03:50,190 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-02 21:03:50,191 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-02 21:03:50,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:43" (3/4) ...
[2022-11-02 21:03:50,193 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2022-11-02 21:03:50,378 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/witness.graphml
[2022-11-02 21:03:50,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-02 21:03:50,379 INFO L158 Benchmark]: Toolchain (without parser) took 8603.04ms. Allocated memory was 102.8MB in the beginning and 224.4MB in the end (delta: 121.6MB). Free memory was 67.9MB in the beginning and 179.8MB in the end (delta: -111.9MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB.
[2022-11-02 21:03:50,379 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 102.8MB. Free memory was 76.5MB in the beginning and 76.5MB in the end (delta: 29.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 21:03:50,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.86ms. Allocated memory is still 102.8MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2022-11-02 21:03:50,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.50ms. Allocated memory is still 102.8MB. Free memory was 66.1MB in the beginning and 63.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2022-11-02 21:03:50,380 INFO L158 Benchmark]: Boogie Preprocessor took 60.86ms. Allocated memory is still 102.8MB. Free memory was 63.7MB in the beginning and 61.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2022-11-02 21:03:50,380 INFO L158 Benchmark]: RCFGBuilder took 1353.32ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 61.6MB in the beginning and 89.4MB in the end (delta: -27.8MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB.
[2022-11-02 21:03:50,381 INFO L158 Benchmark]: TraceAbstraction took 6218.62ms. Allocated memory was 123.7MB in the beginning and 186.6MB in the end (delta: 62.9MB). Free memory was 88.2MB in the beginning and 55.7MB in the end (delta: 32.5MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB.
[2022-11-02 21:03:50,381 INFO L158 Benchmark]: Witness Printer took 187.98ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 55.7MB in the beginning and 179.8MB in the end (delta: -124.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2022-11-02 21:03:50,383 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.30ms. Allocated memory is still 102.8MB. Free memory was 76.5MB in the beginning and 76.5MB in the end (delta: 29.6kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 689.86ms. Allocated memory is still 102.8MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 67.50ms. Allocated memory is still 102.8MB. Free memory was 66.1MB in the beginning and 63.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 60.86ms. Allocated memory is still 102.8MB. Free memory was 63.7MB in the beginning and 61.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 1353.32ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 61.6MB in the beginning and 89.4MB in the end (delta: -27.8MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 6218.62ms. Allocated memory was 123.7MB in the beginning and 186.6MB in the end (delta: 62.9MB). Free memory was 88.2MB in the beginning and 55.7MB in the end (delta: 32.5MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB.
* Witness Printer took 187.98ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 55.7MB in the beginning and 179.8MB in the end (delta: -124.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L711] 0 int __unbuffered_p0_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L713] 0 int __unbuffered_p1_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0]
[L715] 0 int __unbuffered_p1_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0]
[L716] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0]
[L717] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L719] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L720] 0 _Bool x$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L721] 0 int x$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L722] 0 _Bool x$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L723] 0 _Bool x$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L724] 0 _Bool x$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L725] 0 _Bool x$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0]
[L726] 0 _Bool x$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L727] 0 _Bool x$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L728] 0 _Bool x$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0]
[L729] 0 int *x$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L730] 0 int x$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L731] 0 _Bool x$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L732] 0 int x$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L733] 0 _Bool x$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L735] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L737] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L738] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L739] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L813] 0 pthread_t t903;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t903, ((void *)0), P0, ((void *)0))=6, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L815] 0 pthread_t t904;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t904, ((void *)0), P1, ((void *)0))=7, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L771] 2 x$w_buff1 = x$w_buff0
[L772] 2 x$w_buff0 = 1
[L773] 2 x$w_buff1_used = x$w_buff0_used
[L774] 2 x$w_buff0_used = (_Bool)1
[L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L779] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L782] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L785] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L788] 2 __unbuffered_p1_EBX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L743] 1 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L746] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L747] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L748] 1 x$flush_delayed = weak$$choice2
[L749] 1 x$mem_tmp = x
[L750] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L751] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)
[L751] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L752] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L752] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L753] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)
[L753] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L754] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L754] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L755] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)
[L755] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L756] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L756] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757] 1 __unbuffered_p0_EAX = x
[L758] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L758] 1 x = x$flush_delayed ? x$mem_tmp : x
[L759] 1 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L820] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L820] RET 0 assume_abort_if_not(main$tmp_guard0)
[L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L822] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L831] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L19] 0 reach_error()
VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
- UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable
Unable to prove that call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 117 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 278 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 426 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 511 IncrementalHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 56 mSDtfsCounter, 511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=4, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 484 ConstructedInterpolants, 0 QuantifiedInterpolants, 1598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2022-11-02 21:03:50,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8df4a016-b13a-4190-a8d5-55e40aaac173/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE