./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8 --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 bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --- 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-e04fb08 [2022-11-16 10:54:45,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:54:45,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:54:45,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:54:45,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:54:45,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:54:45,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:54:45,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:54:45,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:54:45,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:54:45,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:54:45,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:54:45,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:54:45,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:54:45,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:54:45,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:54:45,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:54:45,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:54:45,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:54:45,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:54:45,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:54:45,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:54:45,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:54:45,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:54:45,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:54:45,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:54:45,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:54:45,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:54:45,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:54:45,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:54:45,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:54:45,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:54:45,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:54:45,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:54:45,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:54:45,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:54:45,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:54:45,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:54:45,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:54:45,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:54:45,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:54:45,527 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 10:54:45,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:54:45,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:54:45,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:54:45,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:54:45,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:54:45,567 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:54:45,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:54:45,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:54:45,568 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:54:45,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:54:45,568 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:54:45,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:54:45,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:54:45,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:54:45,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 10:54:45,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:54:45,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 10:54:45,570 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:54:45,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 10:54:45,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:54:45,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 10:54:45,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:54:45,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:54:45,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:54:45,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:54:45,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:54:45,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:54:45,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 10:54:45,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:54:45,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:54:45,572 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 10:54:45,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 10:54:45,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 10:54:45,572 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_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/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_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8 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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 [2022-11-16 10:54:45,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:54:45,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:54:45,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:54:45,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:54:45,923 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:54:45,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix044.opt.i [2022-11-16 10:54:46,003 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/data/909f228de/6c68915e9ab44d8ebdcdf9b7f8e6bac4/FLAGe71b68b72 [2022-11-16 10:54:46,616 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:54:46,619 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/sv-benchmarks/c/pthread-wmm/mix044.opt.i [2022-11-16 10:54:46,636 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/data/909f228de/6c68915e9ab44d8ebdcdf9b7f8e6bac4/FLAGe71b68b72 [2022-11-16 10:54:46,887 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/data/909f228de/6c68915e9ab44d8ebdcdf9b7f8e6bac4 [2022-11-16 10:54:46,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:54:46,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:54:46,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:54:46,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:54:46,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:54:46,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:54:46" (1/1) ... [2022-11-16 10:54:46,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790ce3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:46, skipping insertion in model container [2022-11-16 10:54:46,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:54:46" (1/1) ... [2022-11-16 10:54:46,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:54:46,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:54:47,216 WARN L229 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_e626274e-4c38-42ab-bbcb-acc206c8dc09/sv-benchmarks/c/pthread-wmm/mix044.opt.i[944,957] [2022-11-16 10:54:47,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:54:47,491 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:54:47,506 WARN L229 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_e626274e-4c38-42ab-bbcb-acc206c8dc09/sv-benchmarks/c/pthread-wmm/mix044.opt.i[944,957] [2022-11-16 10:54:47,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:54:47,590 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:54:47,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47 WrapperNode [2022-11-16 10:54:47,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:54:47,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:54:47,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:54:47,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:54:47,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,679 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-11-16 10:54:47,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:54:47,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:54:47,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:54:47,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:54:47,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,731 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:54:47,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:54:47,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:54:47,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:54:47,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (1/1) ... [2022-11-16 10:54:47,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:54:47,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:47,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:54:47,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:54:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 10:54:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 10:54:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:54:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:54:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:54:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 10:54:47,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 10:54:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 10:54:47,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 10:54:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 10:54:47,841 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 10:54:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 10:54:47,841 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 10:54:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:54:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 10:54:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:54:47,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:54:47,843 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 10:54:48,040 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:54:48,047 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:54:48,418 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:54:48,651 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:54:48,660 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 10:54:48,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:54:48 BoogieIcfgContainer [2022-11-16 10:54:48,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:54:48,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:54:48,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:54:48,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:54:48,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:54:46" (1/3) ... [2022-11-16 10:54:48,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20080d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:54:48, skipping insertion in model container [2022-11-16 10:54:48,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:47" (2/3) ... [2022-11-16 10:54:48,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20080d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:54:48, skipping insertion in model container [2022-11-16 10:54:48,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:54:48" (3/3) ... [2022-11-16 10:54:48,675 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2022-11-16 10:54:48,684 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 10:54:48,694 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:54:48,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 10:54:48,694 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 10:54:48,799 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 10:54:48,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-16 10:54:48,900 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-16 10:54:48,901 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:54:48,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-16 10:54:48,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-16 10:54:48,912 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-16 10:54:48,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:54:48,928 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;@4eac3997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:54:48,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 10:54:48,965 INFO L130 PetriNetUnfolder]: 0/90 cut-off events. [2022-11-16 10:54:48,965 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:54:48,965 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:54:48,966 INFO L209 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] [2022-11-16 10:54:48,966 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:54:48,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash 737380920, now seen corresponding path program 1 times [2022-11-16 10:54:48,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:48,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117426084] [2022-11-16 10:54:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:48,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:49,719 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-16 10:54:49,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:49,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117426084] [2022-11-16 10:54:49,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117426084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:49,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:49,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:54:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777030017] [2022-11-16 10:54:49,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:49,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:54:49,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:49,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:54:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:54:49,767 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2022-11-16 10:54:49,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-16 10:54:49,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:54:49,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2022-11-16 10:54:49,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:54:49,919 INFO L130 PetriNetUnfolder]: 17/277 cut-off events. [2022-11-16 10:54:49,919 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-16 10:54:49,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 277 events. 17/277 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 828 event pairs, 7 based on Foata normal form. 9/275 useless extension candidates. Maximal degree in co-relation 275. Up to 27 conditions per place. [2022-11-16 10:54:49,924 INFO L137 encePairwiseOnDemand]: 132/137 looper letters, 11 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2022-11-16 10:54:49,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 132 transitions, 302 flow [2022-11-16 10:54:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:54:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 10:54:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-11-16 10:54:49,948 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2022-11-16 10:54:49,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-11-16 10:54:49,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-11-16 10:54:49,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:54:49,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-11-16 10:54:49,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-16 10:54:49,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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-16 10:54:49,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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-16 10:54:49,978 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 387 transitions. [2022-11-16 10:54:49,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 132 transitions, 302 flow [2022-11-16 10:54:49,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 132 transitions, 298 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 10:54:49,993 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-11-16 10:54:49,996 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-16 10:54:50,001 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-11-16 10:54:50,001 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-11-16 10:54:50,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-16 10:54:50,002 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:54:50,003 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:54:50,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 10:54:50,003 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:54:50,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1431517774, now seen corresponding path program 1 times [2022-11-16 10:54:50,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:50,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088965293] [2022-11-16 10:54:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:51,521 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-16 10:54:51,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:51,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088965293] [2022-11-16 10:54:51,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088965293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:51,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:51,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:54:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514017840] [2022-11-16 10:54:51,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:51,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:54:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:51,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:54:51,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:54:51,527 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 137 [2022-11-16 10:54:51,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 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-16 10:54:51,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:54:51,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 137 [2022-11-16 10:54:51,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:54:53,663 INFO L130 PetriNetUnfolder]: 3015/7296 cut-off events. [2022-11-16 10:54:53,664 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-11-16 10:54:53,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11838 conditions, 7296 events. 3015/7296 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 66169 event pairs, 390 based on Foata normal form. 0/7145 useless extension candidates. Maximal degree in co-relation 11771. Up to 1675 conditions per place. [2022-11-16 10:54:53,715 INFO L137 encePairwiseOnDemand]: 124/137 looper letters, 39 selfloop transitions, 9 changer transitions 89/221 dead transitions. [2022-11-16 10:54:53,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 221 transitions, 708 flow [2022-11-16 10:54:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 10:54:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 10:54:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1440 transitions. [2022-11-16 10:54:53,719 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8085345311622684 [2022-11-16 10:54:53,720 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1440 transitions. [2022-11-16 10:54:53,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1440 transitions. [2022-11-16 10:54:53,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:54:53,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1440 transitions. [2022-11-16 10:54:53,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 110.76923076923077) internal successors, (1440), 13 states have internal predecessors, (1440), 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-16 10:54:53,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-16 10:54:53,779 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-16 10:54:53,779 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 13 states and 1440 transitions. [2022-11-16 10:54:53,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 221 transitions, 708 flow [2022-11-16 10:54:53,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 221 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 10:54:53,784 INFO L231 Difference]: Finished difference. Result has 162 places, 122 transitions, 360 flow [2022-11-16 10:54:53,785 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=360, PETRI_PLACES=162, PETRI_TRANSITIONS=122} [2022-11-16 10:54:53,785 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 18 predicate places. [2022-11-16 10:54:53,786 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 122 transitions, 360 flow [2022-11-16 10:54:53,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 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-16 10:54:53,787 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:54:53,787 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:54:53,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 10:54:53,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:54:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1367260619, now seen corresponding path program 1 times [2022-11-16 10:54:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:53,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982457609] [2022-11-16 10:54:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:55,044 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-16 10:54:55,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:55,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982457609] [2022-11-16 10:54:55,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982457609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:55,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:55,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 10:54:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305812731] [2022-11-16 10:54:55,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:55,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 10:54:55,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:55,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 10:54:55,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-16 10:54:55,049 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-16 10:54:55,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 122 transitions, 360 flow. Second operand has 12 states, 12 states have (on average 112.5) internal successors, (1350), 12 states have internal predecessors, (1350), 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-16 10:54:55,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:54:55,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-16 10:54:55,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:54:55,937 INFO L130 PetriNetUnfolder]: 1158/2557 cut-off events. [2022-11-16 10:54:55,937 INFO L131 PetriNetUnfolder]: For 5889/6600 co-relation queries the response was YES. [2022-11-16 10:54:55,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8727 conditions, 2557 events. 1158/2557 cut-off events. For 5889/6600 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 18763 event pairs, 480 based on Foata normal form. 131/2576 useless extension candidates. Maximal degree in co-relation 8653. Up to 1243 conditions per place. [2022-11-16 10:54:55,962 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 24 selfloop transitions, 11 changer transitions 31/164 dead transitions. [2022-11-16 10:54:55,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 164 transitions, 744 flow [2022-11-16 10:54:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 10:54:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 10:54:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1608 transitions. [2022-11-16 10:54:55,970 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8383733055265902 [2022-11-16 10:54:55,971 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1608 transitions. [2022-11-16 10:54:55,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1608 transitions. [2022-11-16 10:54:55,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:54:55,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1608 transitions. [2022-11-16 10:54:55,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.85714285714286) internal successors, (1608), 14 states have internal predecessors, (1608), 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-16 10:54:55,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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-16 10:54:55,981 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 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-16 10:54:55,981 INFO L175 Difference]: Start difference. First operand has 162 places, 122 transitions, 360 flow. Second operand 14 states and 1608 transitions. [2022-11-16 10:54:55,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 164 transitions, 744 flow [2022-11-16 10:54:56,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 164 transitions, 714 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-11-16 10:54:56,005 INFO L231 Difference]: Finished difference. Result has 155 places, 127 transitions, 426 flow [2022-11-16 10:54:56,005 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=426, PETRI_PLACES=155, PETRI_TRANSITIONS=127} [2022-11-16 10:54:56,008 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 11 predicate places. [2022-11-16 10:54:56,008 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 127 transitions, 426 flow [2022-11-16 10:54:56,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.5) internal successors, (1350), 12 states have internal predecessors, (1350), 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-16 10:54:56,009 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:54:56,010 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:54:56,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 10:54:56,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:54:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1911831594, now seen corresponding path program 1 times [2022-11-16 10:54:56,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:56,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005525941] [2022-11-16 10:54:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:56,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:56,392 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-16 10:54:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:56,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005525941] [2022-11-16 10:54:56,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005525941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:56,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:56,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:54:56,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812025684] [2022-11-16 10:54:56,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:56,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:54:56,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:54:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:54:56,401 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2022-11-16 10:54:56,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 127 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 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-16 10:54:56,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:54:56,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2022-11-16 10:54:56,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:54:57,207 INFO L130 PetriNetUnfolder]: 1129/2724 cut-off events. [2022-11-16 10:54:57,208 INFO L131 PetriNetUnfolder]: For 9376/10354 co-relation queries the response was YES. [2022-11-16 10:54:57,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10209 conditions, 2724 events. 1129/2724 cut-off events. For 9376/10354 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 20541 event pairs, 535 based on Foata normal form. 71/2693 useless extension candidates. Maximal degree in co-relation 10131. Up to 1150 conditions per place. [2022-11-16 10:54:57,240 INFO L137 encePairwiseOnDemand]: 130/137 looper letters, 41 selfloop transitions, 15 changer transitions 21/179 dead transitions. [2022-11-16 10:54:57,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 179 transitions, 1058 flow [2022-11-16 10:54:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:54:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 10:54:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1094 transitions. [2022-11-16 10:54:57,244 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8872668288726683 [2022-11-16 10:54:57,245 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1094 transitions. [2022-11-16 10:54:57,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1094 transitions. [2022-11-16 10:54:57,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:54:57,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1094 transitions. [2022-11-16 10:54:57,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.55555555555556) internal successors, (1094), 9 states have internal predecessors, (1094), 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-16 10:54:57,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-16 10:54:57,256 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-16 10:54:57,256 INFO L175 Difference]: Start difference. First operand has 155 places, 127 transitions, 426 flow. Second operand 9 states and 1094 transitions. [2022-11-16 10:54:57,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 179 transitions, 1058 flow [2022-11-16 10:54:57,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 179 transitions, 1027 flow, removed 13 selfloop flow, removed 9 redundant places. [2022-11-16 10:54:57,290 INFO L231 Difference]: Finished difference. Result has 153 places, 141 transitions, 580 flow [2022-11-16 10:54:57,296 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=580, PETRI_PLACES=153, PETRI_TRANSITIONS=141} [2022-11-16 10:54:57,298 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2022-11-16 10:54:57,298 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 141 transitions, 580 flow [2022-11-16 10:54:57,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 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-16 10:54:57,298 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:54:57,299 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:54:57,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 10:54:57,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:54:57,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash 976695817, now seen corresponding path program 1 times [2022-11-16 10:54:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:57,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925203748] [2022-11-16 10:54:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:57,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:57,775 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-16 10:54:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:57,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925203748] [2022-11-16 10:54:57,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925203748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:57,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:57,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:54:57,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754056761] [2022-11-16 10:54:57,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:57,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:54:57,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:57,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:54:57,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:54:57,778 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-16 10:54:57,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 141 transitions, 580 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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-16 10:54:57,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:54:57,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-16 10:54:57,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:00,889 INFO L130 PetriNetUnfolder]: 7264/13647 cut-off events. [2022-11-16 10:55:00,890 INFO L131 PetriNetUnfolder]: For 46706/51793 co-relation queries the response was YES. [2022-11-16 10:55:00,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43074 conditions, 13647 events. 7264/13647 cut-off events. For 46706/51793 co-relation queries the response was YES. Maximal size of possible extension queue 1076. Compared 120634 event pairs, 1166 based on Foata normal form. 13/12646 useless extension candidates. Maximal degree in co-relation 42998. Up to 4373 conditions per place. [2022-11-16 10:55:01,033 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 92 selfloop transitions, 20 changer transitions 12/237 dead transitions. [2022-11-16 10:55:01,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 237 transitions, 1467 flow [2022-11-16 10:55:01,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:55:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 10:55:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1204 transitions. [2022-11-16 10:55:01,038 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8788321167883212 [2022-11-16 10:55:01,038 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1204 transitions. [2022-11-16 10:55:01,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1204 transitions. [2022-11-16 10:55:01,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:01,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1204 transitions. [2022-11-16 10:55:01,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.4) internal successors, (1204), 10 states have internal predecessors, (1204), 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-16 10:55:01,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-16 10:55:01,045 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-16 10:55:01,046 INFO L175 Difference]: Start difference. First operand has 153 places, 141 transitions, 580 flow. Second operand 10 states and 1204 transitions. [2022-11-16 10:55:01,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 237 transitions, 1467 flow [2022-11-16 10:55:01,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 237 transitions, 1467 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 10:55:01,128 INFO L231 Difference]: Finished difference. Result has 168 places, 159 transitions, 723 flow [2022-11-16 10:55:01,129 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=723, PETRI_PLACES=168, PETRI_TRANSITIONS=159} [2022-11-16 10:55:01,129 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 24 predicate places. [2022-11-16 10:55:01,130 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 159 transitions, 723 flow [2022-11-16 10:55:01,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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-16 10:55:01,130 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:01,131 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:01,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 10:55:01,131 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:55:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:01,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1252961977, now seen corresponding path program 1 times [2022-11-16 10:55:01,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:01,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776917329] [2022-11-16 10:55:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:01,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:01,547 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-16 10:55:01,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:01,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776917329] [2022-11-16 10:55:01,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776917329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:01,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:01,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:55:01,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457291323] [2022-11-16 10:55:01,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:01,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:55:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:01,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:55:01,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:55:01,553 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-16 10:55:01,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 159 transitions, 723 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 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-16 10:55:01,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:01,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-16 10:55:01,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:04,433 INFO L130 PetriNetUnfolder]: 6348/12659 cut-off events. [2022-11-16 10:55:04,433 INFO L131 PetriNetUnfolder]: For 56259/62156 co-relation queries the response was YES. [2022-11-16 10:55:04,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50893 conditions, 12659 events. 6348/12659 cut-off events. For 56259/62156 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 119463 event pairs, 324 based on Foata normal form. 788/12924 useless extension candidates. Maximal degree in co-relation 50808. Up to 3818 conditions per place. [2022-11-16 10:55:04,531 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 128 selfloop transitions, 38 changer transitions 17/286 dead transitions. [2022-11-16 10:55:04,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 286 transitions, 2159 flow [2022-11-16 10:55:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 10:55:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 10:55:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1568 transitions. [2022-11-16 10:55:04,535 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8804042672655812 [2022-11-16 10:55:04,536 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1568 transitions. [2022-11-16 10:55:04,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1568 transitions. [2022-11-16 10:55:04,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:04,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1568 transitions. [2022-11-16 10:55:04,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.61538461538461) internal successors, (1568), 13 states have internal predecessors, (1568), 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-16 10:55:04,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-16 10:55:04,545 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-16 10:55:04,545 INFO L175 Difference]: Start difference. First operand has 168 places, 159 transitions, 723 flow. Second operand 13 states and 1568 transitions. [2022-11-16 10:55:04,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 286 transitions, 2159 flow [2022-11-16 10:55:04,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 286 transitions, 2121 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-11-16 10:55:04,829 INFO L231 Difference]: Finished difference. Result has 185 places, 168 transitions, 897 flow [2022-11-16 10:55:04,829 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=897, PETRI_PLACES=185, PETRI_TRANSITIONS=168} [2022-11-16 10:55:04,832 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 41 predicate places. [2022-11-16 10:55:04,832 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 168 transitions, 897 flow [2022-11-16 10:55:04,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 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-16 10:55:04,833 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:04,833 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:04,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 10:55:04,834 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:55:04,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:04,834 INFO L85 PathProgramCache]: Analyzing trace with hash 550341310, now seen corresponding path program 1 times [2022-11-16 10:55:04,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:04,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360538289] [2022-11-16 10:55:04,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:04,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:05,949 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-16 10:55:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:05,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360538289] [2022-11-16 10:55:05,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360538289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:05,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:05,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 10:55:05,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341834300] [2022-11-16 10:55:05,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:05,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:55:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:55:05,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:55:05,953 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 137 [2022-11-16 10:55:05,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 168 transitions, 897 flow. Second operand has 8 states, 8 states have (on average 102.625) internal successors, (821), 8 states have internal predecessors, (821), 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-16 10:55:05,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:05,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 137 [2022-11-16 10:55:05,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:08,429 INFO L130 PetriNetUnfolder]: 3257/10730 cut-off events. [2022-11-16 10:55:08,429 INFO L131 PetriNetUnfolder]: For 41159/51060 co-relation queries the response was YES. [2022-11-16 10:55:08,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41090 conditions, 10730 events. 3257/10730 cut-off events. For 41159/51060 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 131296 event pairs, 213 based on Foata normal form. 194/10230 useless extension candidates. Maximal degree in co-relation 40986. Up to 2767 conditions per place. [2022-11-16 10:55:08,538 INFO L137 encePairwiseOnDemand]: 122/137 looper letters, 117 selfloop transitions, 30 changer transitions 0/267 dead transitions. [2022-11-16 10:55:08,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 267 transitions, 2008 flow [2022-11-16 10:55:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:55:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 10:55:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 998 transitions. [2022-11-16 10:55:08,542 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8094079480940795 [2022-11-16 10:55:08,542 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 998 transitions. [2022-11-16 10:55:08,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 998 transitions. [2022-11-16 10:55:08,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:08,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 998 transitions. [2022-11-16 10:55:08,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.88888888888889) internal successors, (998), 9 states have internal predecessors, (998), 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-16 10:55:08,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-16 10:55:08,549 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-16 10:55:08,549 INFO L175 Difference]: Start difference. First operand has 185 places, 168 transitions, 897 flow. Second operand 9 states and 998 transitions. [2022-11-16 10:55:08,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 267 transitions, 2008 flow [2022-11-16 10:55:09,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 267 transitions, 1885 flow, removed 52 selfloop flow, removed 7 redundant places. [2022-11-16 10:55:09,738 INFO L231 Difference]: Finished difference. Result has 187 places, 194 transitions, 1168 flow [2022-11-16 10:55:09,738 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1168, PETRI_PLACES=187, PETRI_TRANSITIONS=194} [2022-11-16 10:55:09,739 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 43 predicate places. [2022-11-16 10:55:09,739 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 194 transitions, 1168 flow [2022-11-16 10:55:09,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.625) internal successors, (821), 8 states have internal predecessors, (821), 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-16 10:55:09,739 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:09,739 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:09,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 10:55:09,739 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:55:09,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:09,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1057906972, now seen corresponding path program 2 times [2022-11-16 10:55:09,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:09,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642859536] [2022-11-16 10:55:09,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:09,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:10,868 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-16 10:55:10,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:10,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642859536] [2022-11-16 10:55:10,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642859536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:10,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:10,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:55:10,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845175155] [2022-11-16 10:55:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:10,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:55:10,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:10,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:55:10,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:55:10,872 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 137 [2022-11-16 10:55:10,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 194 transitions, 1168 flow. Second operand has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 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-16 10:55:10,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:10,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 137 [2022-11-16 10:55:10,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:13,227 INFO L130 PetriNetUnfolder]: 4072/13450 cut-off events. [2022-11-16 10:55:13,228 INFO L131 PetriNetUnfolder]: For 51667/57724 co-relation queries the response was YES. [2022-11-16 10:55:13,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48873 conditions, 13450 events. 4072/13450 cut-off events. For 51667/57724 co-relation queries the response was YES. Maximal size of possible extension queue 1375. Compared 170532 event pairs, 526 based on Foata normal form. 361/12865 useless extension candidates. Maximal degree in co-relation 48766. Up to 2379 conditions per place. [2022-11-16 10:55:13,542 INFO L137 encePairwiseOnDemand]: 128/137 looper letters, 96 selfloop transitions, 33 changer transitions 14/266 dead transitions. [2022-11-16 10:55:13,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 266 transitions, 2211 flow [2022-11-16 10:55:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:55:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 10:55:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1106 transitions. [2022-11-16 10:55:13,546 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8072992700729927 [2022-11-16 10:55:13,546 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1106 transitions. [2022-11-16 10:55:13,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1106 transitions. [2022-11-16 10:55:13,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:13,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1106 transitions. [2022-11-16 10:55:13,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 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-16 10:55:13,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-16 10:55:13,554 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-16 10:55:13,554 INFO L175 Difference]: Start difference. First operand has 187 places, 194 transitions, 1168 flow. Second operand 10 states and 1106 transitions. [2022-11-16 10:55:13,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 266 transitions, 2211 flow [2022-11-16 10:55:14,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 266 transitions, 2191 flow, removed 10 selfloop flow, removed 0 redundant places. [2022-11-16 10:55:14,299 INFO L231 Difference]: Finished difference. Result has 204 places, 210 transitions, 1474 flow [2022-11-16 10:55:14,300 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1474, PETRI_PLACES=204, PETRI_TRANSITIONS=210} [2022-11-16 10:55:14,300 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 60 predicate places. [2022-11-16 10:55:14,300 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 210 transitions, 1474 flow [2022-11-16 10:55:14,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 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-16 10:55:14,301 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:14,301 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:14,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 10:55:14,302 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:55:14,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash -398969650, now seen corresponding path program 1 times [2022-11-16 10:55:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:14,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045302323] [2022-11-16 10:55:14,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:14,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,597 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-16 10:55:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:14,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045302323] [2022-11-16 10:55:14,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045302323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:14,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:14,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 10:55:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797550787] [2022-11-16 10:55:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:14,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:55:14,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:55:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:55:14,601 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-16 10:55:14,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 210 transitions, 1474 flow. Second operand has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 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-16 10:55:14,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:14,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-16 10:55:14,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:21,264 INFO L130 PetriNetUnfolder]: 16327/32251 cut-off events. [2022-11-16 10:55:21,264 INFO L131 PetriNetUnfolder]: For 260589/278653 co-relation queries the response was YES. [2022-11-16 10:55:21,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156724 conditions, 32251 events. 16327/32251 cut-off events. For 260589/278653 co-relation queries the response was YES. Maximal size of possible extension queue 2455. Compared 342660 event pairs, 685 based on Foata normal form. 2064/32894 useless extension candidates. Maximal degree in co-relation 156617. Up to 6679 conditions per place. [2022-11-16 10:55:21,474 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 151 selfloop transitions, 56 changer transitions 109/428 dead transitions. [2022-11-16 10:55:21,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 428 transitions, 4644 flow [2022-11-16 10:55:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 10:55:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 10:55:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1931 transitions. [2022-11-16 10:55:21,478 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8809306569343066 [2022-11-16 10:55:21,478 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1931 transitions. [2022-11-16 10:55:21,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1931 transitions. [2022-11-16 10:55:21,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:21,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1931 transitions. [2022-11-16 10:55:21,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.6875) internal successors, (1931), 16 states have internal predecessors, (1931), 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-16 10:55:21,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 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-16 10:55:21,489 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 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-16 10:55:21,490 INFO L175 Difference]: Start difference. First operand has 204 places, 210 transitions, 1474 flow. Second operand 16 states and 1931 transitions. [2022-11-16 10:55:21,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 428 transitions, 4644 flow [2022-11-16 10:55:25,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 428 transitions, 4574 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-11-16 10:55:25,383 INFO L231 Difference]: Finished difference. Result has 223 places, 212 transitions, 1578 flow [2022-11-16 10:55:25,383 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1578, PETRI_PLACES=223, PETRI_TRANSITIONS=212} [2022-11-16 10:55:25,384 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 79 predicate places. [2022-11-16 10:55:25,384 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 212 transitions, 1578 flow [2022-11-16 10:55:25,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 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-16 10:55:25,385 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:25,385 INFO L209 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, 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-16 10:55:25,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 10:55:25,386 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:55:25,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:25,387 INFO L85 PathProgramCache]: Analyzing trace with hash 190357316, now seen corresponding path program 1 times [2022-11-16 10:55:25,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:25,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651371983] [2022-11-16 10:55:25,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:25,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:25,761 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-16 10:55:25,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:25,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651371983] [2022-11-16 10:55:25,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651371983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:25,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:25,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 10:55:25,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488660158] [2022-11-16 10:55:25,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:25,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 10:55:25,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:25,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 10:55:25,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 10:55:25,770 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-16 10:55:25,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 212 transitions, 1578 flow. Second operand has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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-16 10:55:25,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:25,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-16 10:55:25,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:31,056 INFO L130 PetriNetUnfolder]: 12682/26106 cut-off events. [2022-11-16 10:55:31,056 INFO L131 PetriNetUnfolder]: For 242895/254908 co-relation queries the response was YES. [2022-11-16 10:55:31,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136965 conditions, 26106 events. 12682/26106 cut-off events. For 242895/254908 co-relation queries the response was YES. Maximal size of possible extension queue 2127. Compared 283434 event pairs, 539 based on Foata normal form. 1629/26653 useless extension candidates. Maximal degree in co-relation 136909. Up to 5404 conditions per place. [2022-11-16 10:55:31,229 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 74 selfloop transitions, 57 changer transitions 138/367 dead transitions. [2022-11-16 10:55:31,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 367 transitions, 3826 flow [2022-11-16 10:55:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 10:55:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-16 10:55:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2258 transitions. [2022-11-16 10:55:31,234 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8674606223588167 [2022-11-16 10:55:31,234 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2258 transitions. [2022-11-16 10:55:31,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2258 transitions. [2022-11-16 10:55:31,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:31,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2258 transitions. [2022-11-16 10:55:31,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.84210526315789) internal successors, (2258), 19 states have internal predecessors, (2258), 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-16 10:55:31,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 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-16 10:55:31,246 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 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-16 10:55:31,246 INFO L175 Difference]: Start difference. First operand has 223 places, 212 transitions, 1578 flow. Second operand 19 states and 2258 transitions. [2022-11-16 10:55:31,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 367 transitions, 3826 flow [2022-11-16 10:55:40,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 367 transitions, 3183 flow, removed 274 selfloop flow, removed 23 redundant places. [2022-11-16 10:55:40,054 INFO L231 Difference]: Finished difference. Result has 219 places, 183 transitions, 1059 flow [2022-11-16 10:55:40,054 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1059, PETRI_PLACES=219, PETRI_TRANSITIONS=183} [2022-11-16 10:55:40,055 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 75 predicate places. [2022-11-16 10:55:40,055 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 183 transitions, 1059 flow [2022-11-16 10:55:40,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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-16 10:55:40,055 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:40,056 INFO L209 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, 1, 1, 1, 1, 1, 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-16 10:55:40,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 10:55:40,056 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:55:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2096835340, now seen corresponding path program 1 times [2022-11-16 10:55:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:40,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006772133] [2022-11-16 10:55:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:41,019 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-16 10:55:41,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:41,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006772133] [2022-11-16 10:55:41,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006772133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:41,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:41,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 10:55:41,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691063193] [2022-11-16 10:55:41,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:41,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:55:41,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:41,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:55:41,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:55:41,021 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 137 [2022-11-16 10:55:41,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 183 transitions, 1059 flow. Second operand has 8 states, 8 states have (on average 103.125) internal successors, (825), 8 states have internal predecessors, (825), 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-16 10:55:41,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 10:55:41,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 137 [2022-11-16 10:55:41,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 10:55:41,899 INFO L130 PetriNetUnfolder]: 1338/4808 cut-off events. [2022-11-16 10:55:41,899 INFO L131 PetriNetUnfolder]: For 10548/10855 co-relation queries the response was YES. [2022-11-16 10:55:41,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15637 conditions, 4808 events. 1338/4808 cut-off events. For 10548/10855 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 56799 event pairs, 23 based on Foata normal form. 1/4526 useless extension candidates. Maximal degree in co-relation 15594. Up to 464 conditions per place. [2022-11-16 10:55:41,933 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 43 selfloop transitions, 12 changer transitions 22/212 dead transitions. [2022-11-16 10:55:41,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 212 transitions, 1450 flow [2022-11-16 10:55:41,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:55:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 10:55:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 954 transitions. [2022-11-16 10:55:41,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7737226277372263 [2022-11-16 10:55:41,936 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 954 transitions. [2022-11-16 10:55:41,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 954 transitions. [2022-11-16 10:55:41,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 10:55:41,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 954 transitions. [2022-11-16 10:55:41,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 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-16 10:55:41,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-16 10:55:41,944 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 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-16 10:55:41,952 INFO L175 Difference]: Start difference. First operand has 219 places, 183 transitions, 1059 flow. Second operand 9 states and 954 transitions. [2022-11-16 10:55:41,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 212 transitions, 1450 flow [2022-11-16 10:55:42,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 212 transitions, 1172 flow, removed 65 selfloop flow, removed 29 redundant places. [2022-11-16 10:55:42,189 INFO L231 Difference]: Finished difference. Result has 196 places, 179 transitions, 887 flow [2022-11-16 10:55:42,189 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=887, PETRI_PLACES=196, PETRI_TRANSITIONS=179} [2022-11-16 10:55:42,190 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 52 predicate places. [2022-11-16 10:55:42,190 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 179 transitions, 887 flow [2022-11-16 10:55:42,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.125) internal successors, (825), 8 states have internal predecessors, (825), 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-16 10:55:42,191 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 10:55:42,191 INFO L209 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, 1, 1, 1, 1, 1, 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-16 10:55:42,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 10:55:42,191 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 10:55:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1393747846, now seen corresponding path program 2 times [2022-11-16 10:55:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:42,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275319158] [2022-11-16 10:55:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:55:42,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 10:55:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:55:42,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 10:55:42,362 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 10:55:42,364 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-16 10:55:42,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-16 10:55:42,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-16 10:55:42,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-16 10:55:42,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-16 10:55:42,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-16 10:55:42,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-16 10:55:42,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 10:55:42,369 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:55:42,375 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 10:55:42,376 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 10:55:42,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:55:42 BasicIcfg [2022-11-16 10:55:42,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 10:55:42,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 10:55:42,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 10:55:42,591 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 10:55:42,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:54:48" (3/4) ... [2022-11-16 10:55:42,594 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 10:55:42,784 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 10:55:42,784 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 10:55:42,785 INFO L158 Benchmark]: Toolchain (without parser) took 55890.36ms. Allocated memory was 123.7MB in the beginning and 11.6GB in the end (delta: 11.5GB). Free memory was 83.4MB in the beginning and 9.5GB in the end (delta: -9.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-11-16 10:55:42,786 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 123.7MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:55:42,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.50ms. Allocated memory is still 123.7MB. Free memory was 83.1MB in the beginning and 85.6MB in the end (delta: -2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 10:55:42,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.73ms. Allocated memory is still 123.7MB. Free memory was 85.6MB in the beginning and 83.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:55:42,787 INFO L158 Benchmark]: Boogie Preprocessor took 55.85ms. Allocated memory is still 123.7MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:55:42,787 INFO L158 Benchmark]: RCFGBuilder took 926.61ms. Allocated memory is still 123.7MB. Free memory was 80.9MB in the beginning and 47.4MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-16 10:55:42,788 INFO L158 Benchmark]: TraceAbstraction took 53925.61ms. Allocated memory was 123.7MB in the beginning and 11.6GB in the end (delta: 11.5GB). Free memory was 46.8MB in the beginning and 9.5GB in the end (delta: -9.5GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2022-11-16 10:55:42,788 INFO L158 Benchmark]: Witness Printer took 193.40ms. Allocated memory is still 11.6GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-16 10:55:42,789 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.24ms. Allocated memory is still 123.7MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.50ms. Allocated memory is still 123.7MB. Free memory was 83.1MB in the beginning and 85.6MB in the end (delta: -2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.73ms. Allocated memory is still 123.7MB. Free memory was 85.6MB in the beginning and 83.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.85ms. Allocated memory is still 123.7MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 926.61ms. Allocated memory is still 123.7MB. Free memory was 80.9MB in the beginning and 47.4MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 53925.61ms. Allocated memory was 123.7MB in the beginning and 11.6GB in the end (delta: 11.5GB). Free memory was 46.8MB in the beginning and 9.5GB in the end (delta: -9.5GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 193.40ms. Allocated memory is still 11.6GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L740] 0 _Bool z$r_buff1_thd4; VAL [z$r_buff1_thd4=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [z$r_buff1_thd2=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [z$r_buff1_thd0=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L747] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L745] 0 int z$w_buff1; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L748] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L729] 0 _Bool z$flush_delayed; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L743] 0 int z$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L718] 0 int a = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L720] 0 int b = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1165; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-3, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=-2, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=-1, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: 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: 853]: 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: 847]: 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: 849]: 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: 851]: 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 9 procedures, 173 locations, 7 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: 53.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 44.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 912 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 912 mSDsluCounter, 948 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 747 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1513 IncrementalHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 201 mSDtfsCounter, 1513 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1578occurred in iteration=9, InterpolantAutomatonStates: 125, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1132 NumberOfCodeBlocks, 1132 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1015 ConstructedInterpolants, 0 QuantifiedInterpolants, 3739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-16 10:55:42,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e626274e-4c38-42ab-bbcb-acc206c8dc09/bin/uautomizer-tPACEb0tL8/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