./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:25:55,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:25:55,395 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 23:25:55,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:25:55,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:25:55,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:25:55,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:25:55,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:25:55,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:25:55,445 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:25:55,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:25:55,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:25:55,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:25:55,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:25:55,447 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:25:55,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:25:55,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:25:55,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:25:55,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:25:55,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:25:55,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:25:55,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:25:55,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:25:55,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:25:55,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:25:55,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:25:55,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:25:55,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:25:55,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:25:55,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:25:55,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:25:55,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:25:55,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:25:55,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:25:55,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:25:55,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:25:55,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:25:55,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:25:55,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:25:55,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:25:55,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:25:55,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:25:55,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:25:55,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:25:55,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:25:55,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:25:55,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:25:55,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:25:55,452 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2024-11-23 23:25:55,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:25:55,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:25:55,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:25:55,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:25:55,770 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:25:55,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-23 23:25:58,756 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/data/630852244/edc806fc4a344cd888ac73be2018cc30/FLAG2323f8ad1 [2024-11-23 23:25:59,141 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:25:59,142 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-23 23:25:59,158 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/data/630852244/edc806fc4a344cd888ac73be2018cc30/FLAG2323f8ad1 [2024-11-23 23:25:59,178 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/data/630852244/edc806fc4a344cd888ac73be2018cc30 [2024-11-23 23:25:59,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:25:59,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:25:59,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:25:59,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:25:59,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:25:59,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:59" (1/1) ... [2024-11-23 23:25:59,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6dd8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:59, skipping insertion in model container [2024-11-23 23:25:59,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:59" (1/1) ... [2024-11-23 23:25:59,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:25:59,459 WARN L250 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_f060adf8-af74-43c8-bbfd-b362f7891a63/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i[949,962] [2024-11-23 23:25:59,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:25:59,815 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:25:59,830 WARN L250 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_f060adf8-af74-43c8-bbfd-b362f7891a63/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i[949,962] [2024-11-23 23:25:59,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:26:00,000 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:26:00,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00 WrapperNode [2024-11-23 23:26:00,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:26:00,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:26:00,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:26:00,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:26:00,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,071 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-11-23 23:26:00,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:26:00,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:26:00,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:26:00,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:26:00,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,119 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-23 23:26:00,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:26:00,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:26:00,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:26:00,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:26:00,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (1/1) ... [2024-11-23 23:26:00,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:26:00,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:26:00,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:26:00,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:26:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-23 23:26:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:26:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-23 23:26:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-23 23:26:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-23 23:26:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-23 23:26:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-23 23:26:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-23 23:26:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-23 23:26:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-23 23:26:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:26:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-23 23:26:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:26:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:26:00,241 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-23 23:26:00,452 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:26:00,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:26:00,934 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-23 23:26:00,934 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:26:01,275 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:26:01,275 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 23:26:01,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:01 BoogieIcfgContainer [2024-11-23 23:26:01,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:26:01,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:26:01,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:26:01,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:26:01,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:25:59" (1/3) ... [2024-11-23 23:26:01,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc858c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:01, skipping insertion in model container [2024-11-23 23:26:01,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:00" (2/3) ... [2024-11-23 23:26:01,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc858c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:01, skipping insertion in model container [2024-11-23 23:26:01,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:01" (3/3) ... [2024-11-23 23:26:01,290 INFO L128 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2024-11-23 23:26:01,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:26:01,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix051_tso.oepc.i that has 5 procedures, 48 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-23 23:26:01,310 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-23 23:26:01,397 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-23 23:26:01,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2024-11-23 23:26:01,508 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-11-23 23:26:01,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:26:01,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2024-11-23 23:26:01,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2024-11-23 23:26:01,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2024-11-23 23:26:01,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:26:01,560 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1baf5e49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:26:01,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-23 23:26:01,570 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-23 23:26:01,570 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-23 23:26:01,571 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:26:01,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:01,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-23 23:26:01,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:01,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash -996313560, now seen corresponding path program 1 times [2024-11-23 23:26:01,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:01,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278937691] [2024-11-23 23:26:01,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:26:01,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:26:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:02,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278937691] [2024-11-23 23:26:02,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278937691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:02,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:02,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-23 23:26:02,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021244950] [2024-11-23 23:26:02,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:26:02,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:02,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:26:02,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:26:02,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2024-11-23 23:26:02,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2024-11-23 23:26:02,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:02,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2024-11-23 23:26:02,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:03,662 INFO L124 PetriNetUnfolderBase]: 2160/3608 cut-off events. [2024-11-23 23:26:03,662 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-23 23:26:03,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 3608 events. 2160/3608 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 24770 event pairs, 384 based on Foata normal form. 108/3632 useless extension candidates. Maximal degree in co-relation 6725. Up to 2416 conditions per place. [2024-11-23 23:26:03,720 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 35 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-23 23:26:03,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 212 flow [2024-11-23 23:26:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:26:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 23:26:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-23 23:26:03,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-11-23 23:26:03,740 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 111 transitions. [2024-11-23 23:26:03,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 212 flow [2024-11-23 23:26:03,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-23 23:26:03,753 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2024-11-23 23:26:03,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-11-23 23:26:03,764 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2024-11-23 23:26:03,764 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2024-11-23 23:26:03,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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) [2024-11-23 23:26:03,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:03,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:26:03,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:26:03,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:03,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash 998320935, now seen corresponding path program 1 times [2024-11-23 23:26:03,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:03,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365795155] [2024-11-23 23:26:03,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:26:03,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:26:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:05,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:05,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365795155] [2024-11-23 23:26:05,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365795155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:05,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:05,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:26:05,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81774540] [2024-11-23 23:26:05,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:05,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:26:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:05,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:26:05,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:26:05,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-23 23:26:05,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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) [2024-11-23 23:26:05,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:05,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-23 23:26:05,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:06,865 INFO L124 PetriNetUnfolderBase]: 4352/6814 cut-off events. [2024-11-23 23:26:06,865 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2024-11-23 23:26:06,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13385 conditions, 6814 events. 4352/6814 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 48899 event pairs, 983 based on Foata normal form. 0/6656 useless extension candidates. Maximal degree in co-relation 13375. Up to 3913 conditions per place. [2024-11-23 23:26:06,915 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 36 selfloop transitions, 3 changer transitions 48/103 dead transitions. [2024-11-23 23:26:06,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 103 transitions, 410 flow [2024-11-23 23:26:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:26:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 23:26:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 249 transitions. [2024-11-23 23:26:06,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2024-11-23 23:26:06,918 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 8 states and 249 transitions. [2024-11-23 23:26:06,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 103 transitions, 410 flow [2024-11-23 23:26:06,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 103 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 23:26:06,921 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 123 flow [2024-11-23 23:26:06,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-11-23 23:26:06,922 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2024-11-23 23:26:06,922 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 123 flow [2024-11-23 23:26:06,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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) [2024-11-23 23:26:06,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:06,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:26:06,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:26:06,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:06,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1641187607, now seen corresponding path program 1 times [2024-11-23 23:26:06,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:06,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769291348] [2024-11-23 23:26:06,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:26:06,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:26:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:07,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:07,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769291348] [2024-11-23 23:26:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769291348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:07,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:07,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:26:07,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895212616] [2024-11-23 23:26:07,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:07,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:26:07,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:07,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:26:07,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:26:07,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-23 23:26:07,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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) [2024-11-23 23:26:07,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:07,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-23 23:26:07,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:09,515 INFO L124 PetriNetUnfolderBase]: 3518/5553 cut-off events. [2024-11-23 23:26:09,515 INFO L125 PetriNetUnfolderBase]: For 3599/3599 co-relation queries the response was YES. [2024-11-23 23:26:09,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13283 conditions, 5553 events. 3518/5553 cut-off events. For 3599/3599 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 36336 event pairs, 2058 based on Foata normal form. 116/5646 useless extension candidates. Maximal degree in co-relation 13268. Up to 3935 conditions per place. [2024-11-23 23:26:09,579 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 45 selfloop transitions, 7 changer transitions 33/101 dead transitions. [2024-11-23 23:26:09,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 461 flow [2024-11-23 23:26:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:26:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 23:26:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 247 transitions. [2024-11-23 23:26:09,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6432291666666666 [2024-11-23 23:26:09,582 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 123 flow. Second operand 8 states and 247 transitions. [2024-11-23 23:26:09,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 461 flow [2024-11-23 23:26:09,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 450 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-11-23 23:26:09,609 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 183 flow [2024-11-23 23:26:09,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=183, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2024-11-23 23:26:09,610 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2024-11-23 23:26:09,611 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 183 flow [2024-11-23 23:26:09,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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) [2024-11-23 23:26:09,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:09,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:26:09,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:26:09,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:09,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash -538760536, now seen corresponding path program 1 times [2024-11-23 23:26:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:09,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659183503] [2024-11-23 23:26:09,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:26:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:26:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:10,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:10,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659183503] [2024-11-23 23:26:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659183503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:10,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:10,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:26:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984628113] [2024-11-23 23:26:10,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:10,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:26:10,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:10,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:26:10,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:26:10,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-23 23:26:10,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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) [2024-11-23 23:26:10,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:10,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-23 23:26:10,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:11,399 INFO L124 PetriNetUnfolderBase]: 3583/5761 cut-off events. [2024-11-23 23:26:11,399 INFO L125 PetriNetUnfolderBase]: For 12107/12157 co-relation queries the response was YES. [2024-11-23 23:26:11,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18462 conditions, 5761 events. 3583/5761 cut-off events. For 12107/12157 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 39984 event pairs, 483 based on Foata normal form. 120/5817 useless extension candidates. Maximal degree in co-relation 18443. Up to 3429 conditions per place. [2024-11-23 23:26:11,461 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 52 selfloop transitions, 9 changer transitions 33/110 dead transitions. [2024-11-23 23:26:11,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 110 transitions, 643 flow [2024-11-23 23:26:11,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:26:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 23:26:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 251 transitions. [2024-11-23 23:26:11,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6536458333333334 [2024-11-23 23:26:11,463 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 183 flow. Second operand 8 states and 251 transitions. [2024-11-23 23:26:11,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 110 transitions, 643 flow [2024-11-23 23:26:11,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 110 transitions, 616 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-11-23 23:26:11,507 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 234 flow [2024-11-23 23:26:11,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=234, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2024-11-23 23:26:11,508 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-11-23 23:26:11,508 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 234 flow [2024-11-23 23:26:11,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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) [2024-11-23 23:26:11,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:11,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:26:11,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 23:26:11,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1212021600, now seen corresponding path program 2 times [2024-11-23 23:26:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910536943] [2024-11-23 23:26:11,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:26:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:11,544 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:26:11,546 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:26:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:12,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:12,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910536943] [2024-11-23 23:26:12,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910536943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:12,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:12,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:26:12,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854108819] [2024-11-23 23:26:12,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:12,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:26:12,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:12,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:26:12,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:26:12,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-23 23:26:12,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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) [2024-11-23 23:26:12,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:12,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-23 23:26:12,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:13,516 INFO L124 PetriNetUnfolderBase]: 3358/5311 cut-off events. [2024-11-23 23:26:13,516 INFO L125 PetriNetUnfolderBase]: For 15295/15370 co-relation queries the response was YES. [2024-11-23 23:26:13,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19032 conditions, 5311 events. 3358/5311 cut-off events. For 15295/15370 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 35975 event pairs, 467 based on Foata normal form. 132/5379 useless extension candidates. Maximal degree in co-relation 19010. Up to 3348 conditions per place. [2024-11-23 23:26:13,566 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 49 selfloop transitions, 9 changer transitions 33/107 dead transitions. [2024-11-23 23:26:13,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 680 flow [2024-11-23 23:26:13,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:26:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 23:26:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 248 transitions. [2024-11-23 23:26:13,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-23 23:26:13,568 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 234 flow. Second operand 8 states and 248 transitions. [2024-11-23 23:26:13,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 680 flow [2024-11-23 23:26:13,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 634 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-23 23:26:13,612 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 238 flow [2024-11-23 23:26:13,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2024-11-23 23:26:13,616 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2024-11-23 23:26:13,616 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 238 flow [2024-11-23 23:26:13,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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) [2024-11-23 23:26:13,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:13,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:26:13,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:26:13,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:13,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash 204509962, now seen corresponding path program 1 times [2024-11-23 23:26:13,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:13,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497693833] [2024-11-23 23:26:13,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:26:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:26:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:13,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:13,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497693833] [2024-11-23 23:26:13,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497693833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:13,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:13,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:26:13,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576058005] [2024-11-23 23:26:13,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:13,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:26:13,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:13,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:26:13,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:26:13,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-23 23:26:13,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2024-11-23 23:26:13,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:13,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-23 23:26:13,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:15,724 INFO L124 PetriNetUnfolderBase]: 8735/12654 cut-off events. [2024-11-23 23:26:15,724 INFO L125 PetriNetUnfolderBase]: For 29366/29485 co-relation queries the response was YES. [2024-11-23 23:26:15,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41283 conditions, 12654 events. 8735/12654 cut-off events. For 29366/29485 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 81808 event pairs, 985 based on Foata normal form. 532/12912 useless extension candidates. Maximal degree in co-relation 41259. Up to 6837 conditions per place. [2024-11-23 23:26:15,837 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 76 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2024-11-23 23:26:15,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 97 transitions, 636 flow [2024-11-23 23:26:15,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:26:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-23 23:26:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-11-23 23:26:15,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2024-11-23 23:26:15,839 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 238 flow. Second operand 4 states and 131 transitions. [2024-11-23 23:26:15,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 97 transitions, 636 flow [2024-11-23 23:26:15,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 576 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-11-23 23:26:15,863 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 252 flow [2024-11-23 23:26:15,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2024-11-23 23:26:15,865 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2024-11-23 23:26:15,866 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 252 flow [2024-11-23 23:26:15,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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) [2024-11-23 23:26:15,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:15,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:26:15,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 23:26:15,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:15,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -218313075, now seen corresponding path program 1 times [2024-11-23 23:26:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:15,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481895583] [2024-11-23 23:26:15,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:26:15,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:26:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481895583] [2024-11-23 23:26:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481895583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:26:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378701690] [2024-11-23 23:26:16,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:16,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:26:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:16,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:26:16,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:26:16,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-23 23:26:16,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2024-11-23 23:26:16,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:16,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-23 23:26:16,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:17,523 INFO L124 PetriNetUnfolderBase]: 7543/11094 cut-off events. [2024-11-23 23:26:17,524 INFO L125 PetriNetUnfolderBase]: For 21266/21377 co-relation queries the response was YES. [2024-11-23 23:26:17,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36605 conditions, 11094 events. 7543/11094 cut-off events. For 21266/21377 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 70748 event pairs, 545 based on Foata normal form. 486/11299 useless extension candidates. Maximal degree in co-relation 36584. Up to 4321 conditions per place. [2024-11-23 23:26:17,583 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 91 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2024-11-23 23:26:17,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 116 transitions, 741 flow [2024-11-23 23:26:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:26:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-23 23:26:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-11-23 23:26:17,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-23 23:26:17,585 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 252 flow. Second operand 5 states and 168 transitions. [2024-11-23 23:26:17,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 116 transitions, 741 flow [2024-11-23 23:26:17,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 734 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-23 23:26:17,597 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 313 flow [2024-11-23 23:26:17,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2024-11-23 23:26:17,599 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-11-23 23:26:17,599 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 313 flow [2024-11-23 23:26:17,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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) [2024-11-23 23:26:17,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:17,600 INFO L206 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] [2024-11-23 23:26:17,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 23:26:17,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:17,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:17,601 INFO L85 PathProgramCache]: Analyzing trace with hash -160055579, now seen corresponding path program 1 times [2024-11-23 23:26:17,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:17,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857803444] [2024-11-23 23:26:17,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:26:17,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:26:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:17,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:17,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857803444] [2024-11-23 23:26:17,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857803444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:17,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:17,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:26:17,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351670599] [2024-11-23 23:26:17,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:17,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:26:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:17,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:26:17,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:26:17,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-23 23:26:17,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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) [2024-11-23 23:26:17,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:17,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-23 23:26:17,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:19,126 INFO L124 PetriNetUnfolderBase]: 5975/8834 cut-off events. [2024-11-23 23:26:19,127 INFO L125 PetriNetUnfolderBase]: For 22482/22585 co-relation queries the response was YES. [2024-11-23 23:26:19,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31428 conditions, 8834 events. 5975/8834 cut-off events. For 22482/22585 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 53864 event pairs, 397 based on Foata normal form. 350/8904 useless extension candidates. Maximal degree in co-relation 31405. Up to 2720 conditions per place. [2024-11-23 23:26:19,164 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 99 selfloop transitions, 14 changer transitions 0/128 dead transitions. [2024-11-23 23:26:19,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 128 transitions, 870 flow [2024-11-23 23:26:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:26:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-23 23:26:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2024-11-23 23:26:19,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7048611111111112 [2024-11-23 23:26:19,166 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 313 flow. Second operand 6 states and 203 transitions. [2024-11-23 23:26:19,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 128 transitions, 870 flow [2024-11-23 23:26:19,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 128 transitions, 854 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-23 23:26:19,177 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 377 flow [2024-11-23 23:26:19,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2024-11-23 23:26:19,178 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2024-11-23 23:26:19,178 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 377 flow [2024-11-23 23:26:19,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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) [2024-11-23 23:26:19,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:19,179 INFO L206 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] [2024-11-23 23:26:19,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 23:26:19,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:19,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash 798117322, now seen corresponding path program 1 times [2024-11-23 23:26:19,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:19,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8554842] [2024-11-23 23:26:19,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:26:19,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:26:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8554842] [2024-11-23 23:26:19,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8554842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:19,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:19,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:26:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533529937] [2024-11-23 23:26:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:19,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:26:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:19,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:26:19,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:26:19,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-23 23:26:19,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 377 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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) [2024-11-23 23:26:19,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:19,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-23 23:26:19,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:20,588 INFO L124 PetriNetUnfolderBase]: 5215/7642 cut-off events. [2024-11-23 23:26:20,589 INFO L125 PetriNetUnfolderBase]: For 26478/26581 co-relation queries the response was YES. [2024-11-23 23:26:20,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29344 conditions, 7642 events. 5215/7642 cut-off events. For 26478/26581 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 45786 event pairs, 397 based on Foata normal form. 198/7560 useless extension candidates. Maximal degree in co-relation 29319. Up to 2720 conditions per place. [2024-11-23 23:26:20,651 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 92 selfloop transitions, 18 changer transitions 0/125 dead transitions. [2024-11-23 23:26:20,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 125 transitions, 860 flow [2024-11-23 23:26:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:26:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 23:26:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 218 transitions. [2024-11-23 23:26:20,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2024-11-23 23:26:20,653 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 377 flow. Second operand 7 states and 218 transitions. [2024-11-23 23:26:20,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 125 transitions, 860 flow [2024-11-23 23:26:20,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 798 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-11-23 23:26:20,707 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 388 flow [2024-11-23 23:26:20,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-11-23 23:26:20,708 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 22 predicate places. [2024-11-23 23:26:20,708 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 388 flow [2024-11-23 23:26:20,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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) [2024-11-23 23:26:20,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:20,709 INFO L206 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] [2024-11-23 23:26:20,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 23:26:20,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:20,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:20,710 INFO L85 PathProgramCache]: Analyzing trace with hash 40785539, now seen corresponding path program 1 times [2024-11-23 23:26:20,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:20,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130945214] [2024-11-23 23:26:20,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:26:20,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:26:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:21,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:21,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130945214] [2024-11-23 23:26:21,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130945214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 23:26:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683524313] [2024-11-23 23:26:21,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:21,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:26:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:21,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:26:21,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:26:21,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-11-23 23:26:21,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 388 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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) [2024-11-23 23:26:21,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:21,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-11-23 23:26:21,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:23,087 INFO L124 PetriNetUnfolderBase]: 8677/14006 cut-off events. [2024-11-23 23:26:23,087 INFO L125 PetriNetUnfolderBase]: For 35303/38683 co-relation queries the response was YES. [2024-11-23 23:26:23,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44422 conditions, 14006 events. 8677/14006 cut-off events. For 35303/38683 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 104551 event pairs, 1901 based on Foata normal form. 295/13053 useless extension candidates. Maximal degree in co-relation 44396. Up to 5691 conditions per place. [2024-11-23 23:26:23,167 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 51 selfloop transitions, 5 changer transitions 52/139 dead transitions. [2024-11-23 23:26:23,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 139 transitions, 879 flow [2024-11-23 23:26:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:26:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 23:26:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 225 transitions. [2024-11-23 23:26:23,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2024-11-23 23:26:23,169 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 388 flow. Second operand 8 states and 225 transitions. [2024-11-23 23:26:23,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 139 transitions, 879 flow [2024-11-23 23:26:23,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 139 transitions, 792 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-11-23 23:26:23,555 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 375 flow [2024-11-23 23:26:23,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=375, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2024-11-23 23:26:23,556 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2024-11-23 23:26:23,556 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 375 flow [2024-11-23 23:26:23,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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) [2024-11-23 23:26:23,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:23,556 INFO L206 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] [2024-11-23 23:26:23,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 23:26:23,556 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:23,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:23,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1711464353, now seen corresponding path program 2 times [2024-11-23 23:26:23,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:23,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474250675] [2024-11-23 23:26:23,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:26:23,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:23,587 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:26:23,587 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:26:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:24,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474250675] [2024-11-23 23:26:24,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474250675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:24,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:24,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 23:26:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456720174] [2024-11-23 23:26:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:24,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:26:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:24,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:26:24,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:26:24,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-11-23 23:26:24,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 375 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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) [2024-11-23 23:26:24,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:24,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-11-23 23:26:24,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:26,555 INFO L124 PetriNetUnfolderBase]: 7442/12154 cut-off events. [2024-11-23 23:26:26,556 INFO L125 PetriNetUnfolderBase]: For 18002/19922 co-relation queries the response was YES. [2024-11-23 23:26:26,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35378 conditions, 12154 events. 7442/12154 cut-off events. For 18002/19922 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 92258 event pairs, 949 based on Foata normal form. 220/11012 useless extension candidates. Maximal degree in co-relation 35348. Up to 4955 conditions per place. [2024-11-23 23:26:26,644 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 74 selfloop transitions, 9 changer transitions 12/126 dead transitions. [2024-11-23 23:26:26,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 126 transitions, 790 flow [2024-11-23 23:26:26,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:26:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 23:26:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-11-23 23:26:26,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5598958333333334 [2024-11-23 23:26:26,646 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 375 flow. Second operand 8 states and 215 transitions. [2024-11-23 23:26:26,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 126 transitions, 790 flow [2024-11-23 23:26:26,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 126 transitions, 780 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-23 23:26:26,818 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 420 flow [2024-11-23 23:26:26,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=420, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2024-11-23 23:26:26,819 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2024-11-23 23:26:26,819 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 420 flow [2024-11-23 23:26:26,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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) [2024-11-23 23:26:26,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:26,819 INFO L206 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] [2024-11-23 23:26:26,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 23:26:26,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:26,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash -997496171, now seen corresponding path program 3 times [2024-11-23 23:26:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:26,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287370950] [2024-11-23 23:26:26,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:26:26,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:26,861 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 23:26:26,861 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:26:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287370950] [2024-11-23 23:26:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287370950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:27,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:27,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 23:26:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093105104] [2024-11-23 23:26:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:27,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:26:27,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:27,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:26:27,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:26:27,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-11-23 23:26:27,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 420 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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) [2024-11-23 23:26:27,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:27,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-11-23 23:26:27,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:30,059 INFO L124 PetriNetUnfolderBase]: 12337/20758 cut-off events. [2024-11-23 23:26:30,059 INFO L125 PetriNetUnfolderBase]: For 33624/36628 co-relation queries the response was YES. [2024-11-23 23:26:30,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62000 conditions, 20758 events. 12337/20758 cut-off events. For 33624/36628 co-relation queries the response was YES. Maximal size of possible extension queue 1533. Compared 177355 event pairs, 1927 based on Foata normal form. 367/18827 useless extension candidates. Maximal degree in co-relation 61967. Up to 7429 conditions per place. [2024-11-23 23:26:30,186 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 40 selfloop transitions, 4 changer transitions 57/132 dead transitions. [2024-11-23 23:26:30,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 132 transitions, 890 flow [2024-11-23 23:26:30,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:26:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 23:26:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-11-23 23:26:30,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-11-23 23:26:30,188 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 420 flow. Second operand 8 states and 210 transitions. [2024-11-23 23:26:30,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 132 transitions, 890 flow [2024-11-23 23:26:31,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 132 transitions, 875 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-23 23:26:31,187 INFO L231 Difference]: Finished difference. Result has 95 places, 62 transitions, 355 flow [2024-11-23 23:26:31,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=355, PETRI_PLACES=95, PETRI_TRANSITIONS=62} [2024-11-23 23:26:31,188 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 39 predicate places. [2024-11-23 23:26:31,188 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 62 transitions, 355 flow [2024-11-23 23:26:31,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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) [2024-11-23 23:26:31,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:31,188 INFO L206 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] [2024-11-23 23:26:31,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 23:26:31,188 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:31,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:31,189 INFO L85 PathProgramCache]: Analyzing trace with hash -95273471, now seen corresponding path program 4 times [2024-11-23 23:26:31,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:31,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993585678] [2024-11-23 23:26:31,189 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 23:26:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:31,265 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 23:26:31,265 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:26:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:32,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:32,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993585678] [2024-11-23 23:26:32,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993585678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:32,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:32,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 23:26:32,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689136345] [2024-11-23 23:26:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:32,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 23:26:32,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:32,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:26:32,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-23 23:26:32,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-11-23 23:26:32,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 62 transitions, 355 flow. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 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) [2024-11-23 23:26:32,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:32,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-11-23 23:26:32,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:34,040 INFO L124 PetriNetUnfolderBase]: 4613/8282 cut-off events. [2024-11-23 23:26:34,040 INFO L125 PetriNetUnfolderBase]: For 12100/13609 co-relation queries the response was YES. [2024-11-23 23:26:34,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24296 conditions, 8282 events. 4613/8282 cut-off events. For 12100/13609 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 64874 event pairs, 1011 based on Foata normal form. 128/7436 useless extension candidates. Maximal degree in co-relation 24260. Up to 3288 conditions per place. [2024-11-23 23:26:34,120 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 40 selfloop transitions, 8 changer transitions 12/93 dead transitions. [2024-11-23 23:26:34,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 583 flow [2024-11-23 23:26:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:26:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 23:26:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2024-11-23 23:26:34,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-11-23 23:26:34,122 INFO L175 Difference]: Start difference. First operand has 95 places, 62 transitions, 355 flow. Second operand 7 states and 203 transitions. [2024-11-23 23:26:34,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 583 flow [2024-11-23 23:26:34,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 93 transitions, 547 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-11-23 23:26:34,306 INFO L231 Difference]: Finished difference. Result has 90 places, 65 transitions, 381 flow [2024-11-23 23:26:34,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=381, PETRI_PLACES=90, PETRI_TRANSITIONS=65} [2024-11-23 23:26:34,307 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 34 predicate places. [2024-11-23 23:26:34,307 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 65 transitions, 381 flow [2024-11-23 23:26:34,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 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) [2024-11-23 23:26:34,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:34,308 INFO L206 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] [2024-11-23 23:26:34,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 23:26:34,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:34,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1525627265, now seen corresponding path program 5 times [2024-11-23 23:26:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:34,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616148306] [2024-11-23 23:26:34,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 23:26:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:34,386 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:26:34,387 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:26:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:26:37,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:26:37,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616148306] [2024-11-23 23:26:37,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616148306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:26:37,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:26:37,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-23 23:26:37,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776626862] [2024-11-23 23:26:37,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:26:37,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-23 23:26:37,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:26:37,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 23:26:37,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-23 23:26:37,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-23 23:26:37,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 65 transitions, 381 flow. Second operand has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 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) [2024-11-23 23:26:37,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:26:37,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-23 23:26:37,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:26:39,381 INFO L124 PetriNetUnfolderBase]: 5465/9923 cut-off events. [2024-11-23 23:26:39,381 INFO L125 PetriNetUnfolderBase]: For 17320/19072 co-relation queries the response was YES. [2024-11-23 23:26:39,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30490 conditions, 9923 events. 5465/9923 cut-off events. For 17320/19072 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 81332 event pairs, 1777 based on Foata normal form. 161/9005 useless extension candidates. Maximal degree in co-relation 30457. Up to 4221 conditions per place. [2024-11-23 23:26:39,451 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 39 selfloop transitions, 9 changer transitions 28/109 dead transitions. [2024-11-23 23:26:39,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 109 transitions, 687 flow [2024-11-23 23:26:39,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:26:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-23 23:26:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 249 transitions. [2024-11-23 23:26:39,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2024-11-23 23:26:39,453 INFO L175 Difference]: Start difference. First operand has 90 places, 65 transitions, 381 flow. Second operand 9 states and 249 transitions. [2024-11-23 23:26:39,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 109 transitions, 687 flow [2024-11-23 23:26:39,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 109 transitions, 677 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-23 23:26:39,750 INFO L231 Difference]: Finished difference. Result has 96 places, 65 transitions, 402 flow [2024-11-23 23:26:39,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=402, PETRI_PLACES=96, PETRI_TRANSITIONS=65} [2024-11-23 23:26:39,751 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 40 predicate places. [2024-11-23 23:26:39,751 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 65 transitions, 402 flow [2024-11-23 23:26:39,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 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) [2024-11-23 23:26:39,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:26:39,751 INFO L206 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] [2024-11-23 23:26:39,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-23 23:26:39,751 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-23 23:26:39,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:26:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash -452568347, now seen corresponding path program 6 times [2024-11-23 23:26:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:26:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449203733] [2024-11-23 23:26:39,753 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 23:26:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:26:39,850 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 23:26:39,851 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 23:26:39,851 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:26:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:26:39,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 23:26:39,985 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 23:26:39,986 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-23 23:26:39,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-23 23:26:39,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-23 23:26:39,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-23 23:26:39,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-23 23:26:39,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-23 23:26:39,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-23 23:26:39,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 23:26:39,990 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:26:40,098 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-23 23:26:40,099 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 23:26:40,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:26:40 BasicIcfg [2024-11-23 23:26:40,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 23:26:40,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 23:26:40,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 23:26:40,106 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 23:26:40,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:01" (3/4) ... [2024-11-23 23:26:40,108 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-23 23:26:40,256 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-23 23:26:40,317 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-23 23:26:40,319 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-23 23:26:40,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 23:26:40,321 INFO L158 Benchmark]: Toolchain (without parser) took 41138.63ms. Allocated memory was 117.4MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 91.4MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 449.0MB. Max. memory is 16.1GB. [2024-11-23 23:26:40,322 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 117.4MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:26:40,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 817.14ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 67.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-23 23:26:40,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.17ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 64.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:26:40,324 INFO L158 Benchmark]: Boogie Preprocessor took 72.67ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 61.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:26:40,325 INFO L158 Benchmark]: RCFGBuilder took 1131.34ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 59.4MB in the end (delta: 1.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-23 23:26:40,325 INFO L158 Benchmark]: TraceAbstraction took 38825.44ms. Allocated memory was 117.4MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 58.8MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 401.6MB. Max. memory is 16.1GB. [2024-11-23 23:26:40,326 INFO L158 Benchmark]: Witness Printer took 213.89ms. Allocated memory is still 3.0GB. Free memory was 2.6GB in the beginning and 2.5GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 23:26:40,328 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 117.4MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 817.14ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 67.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.17ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 64.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.67ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 61.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1131.34ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 59.4MB in the end (delta: 1.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 38825.44ms. Allocated memory was 117.4MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 58.8MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 401.6MB. Max. memory is 16.1GB. * Witness Printer took 213.89ms. Allocated memory is still 3.0GB. Free memory was 2.6GB in the beginning and 2.5GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 81 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: 38.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 992 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 952 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2496 IncrementalHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 36 mSDtfsCounter, 2496 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=11, InterpolantAutomatonStates: 97, 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.8s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 3379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-23 23:26:40,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f060adf8-af74-43c8-bbfd-b362f7891a63/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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