./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya --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 d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:29:58,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:29:58,881 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:29:58,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:29:58,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:29:58,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:29:58,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:29:58,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:29:58,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:29:58,908 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:29:58,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:29:58,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:29:58,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:29:58,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:29:58,911 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:29:58,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:29:58,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:29:58,913 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:29:58,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:29:58,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:29:58,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:29:58,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:29:58,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:29:58,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:29:58,916 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:29:58,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:29:58,916 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:29:58,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:29:58,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:29:58,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:29:58,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:29:58,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:29:58,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:29:58,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:29:58,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:29:58,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:29:58,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:29:58,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:29:58,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:29:58,920 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:29:58,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:29:58,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:29:58,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya 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 -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2023-11-29 03:29:59,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:29:59,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:29:59,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:29:59,202 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:29:59,202 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:29:59,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2023-11-29 03:30:01,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:30:02,219 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:30:02,220 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2023-11-29 03:30:02,239 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/data/bc07d3be9/bf2931f984de4b7286a2c329096db4a8/FLAGbb425b833 [2023-11-29 03:30:02,251 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/data/bc07d3be9/bf2931f984de4b7286a2c329096db4a8 [2023-11-29 03:30:02,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:30:02,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:30:02,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:30:02,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:30:02,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:30:02,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1825d6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02, skipping insertion in model container [2023-11-29 03:30:02,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,312 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:30:02,444 WARN L240 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_cffe1a57-0c96-48e5-aa05-2ebf741ced54/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2023-11-29 03:30:02,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:30:02,628 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:30:02,638 WARN L240 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_cffe1a57-0c96-48e5-aa05-2ebf741ced54/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2023-11-29 03:30:02,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:30:02,713 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:30:02,713 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:30:02,719 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:30:02,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02 WrapperNode [2023-11-29 03:30:02,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:30:02,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:30:02,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:30:02,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:30:02,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,766 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-11-29 03:30:02,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:30:02,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:30:02,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:30:02,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:30:02,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,799 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 03:30:02,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:30:02,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:30:02,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:30:02,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:30:02,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (1/1) ... [2023-11-29 03:30:02,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:30:02,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:30:02,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:30:02,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:30:02,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:30:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:30:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:30:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 03:30:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 03:30:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:30:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:30:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:30:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 03:30:02,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 03:30:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 03:30:02,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 03:30:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 03:30:02,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 03:30:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:30:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:30:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:30:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 03:30:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 03:30:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:30:02,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:30:02,885 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 03:30:03,029 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:30:03,031 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:30:03,314 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:30:03,468 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:30:03,468 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 03:30:03,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:30:03 BoogieIcfgContainer [2023-11-29 03:30:03,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:30:03,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:30:03,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:30:03,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:30:03,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:30:02" (1/3) ... [2023-11-29 03:30:03,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4b2b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:30:03, skipping insertion in model container [2023-11-29 03:30:03,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:30:02" (2/3) ... [2023-11-29 03:30:03,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4b2b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:30:03, skipping insertion in model container [2023-11-29 03:30:03,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:30:03" (3/3) ... [2023-11-29 03:30:03,478 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2023-11-29 03:30:03,487 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 03:30:03,498 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:30:03,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 03:30:03,499 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 03:30:03,545 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 03:30:03,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2023-11-29 03:30:03,624 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2023-11-29 03:30:03,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:30:03,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-29 03:30:03,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2023-11-29 03:30:03,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2023-11-29 03:30:03,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:30:03,649 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@6ab45e08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:30:03,649 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 03:30:03,655 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 03:30:03,655 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-29 03:30:03,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:30:03,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:03,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:30:03,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:03,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2060963303, now seen corresponding path program 1 times [2023-11-29 03:30:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:03,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122641832] [2023-11-29 03:30:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:03,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:04,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122641832] [2023-11-29 03:30:04,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122641832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:04,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:04,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:30:04,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151393993] [2023-11-29 03:30:04,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:04,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:30:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:04,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:30:04,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:30:04,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2023-11-29 03:30:04,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2023-11-29 03:30:04,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:04,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2023-11-29 03:30:04,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:04,420 INFO L124 PetriNetUnfolderBase]: 528/1007 cut-off events. [2023-11-29 03:30:04,421 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-29 03:30:04,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 1007 events. 528/1007 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6212 event pairs, 84 based on Foata normal form. 36/1013 useless extension candidates. Maximal degree in co-relation 1844. Up to 652 conditions per place. [2023-11-29 03:30:04,432 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 27 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-11-29 03:30:04,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 168 flow [2023-11-29 03:30:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:30:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:30:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2023-11-29 03:30:04,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2023-11-29 03:30:04,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 91 transitions. [2023-11-29 03:30:04,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 91 transitions. [2023-11-29 03:30:04,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:04,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 91 transitions. [2023-11-29 03:30:04,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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) [2023-11-29 03:30:04,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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) [2023-11-29 03:30:04,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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) [2023-11-29 03:30:04,453 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 91 transitions. [2023-11-29 03:30:04,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 168 flow [2023-11-29 03:30:04,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 03:30:04,458 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2023-11-29 03:30:04,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-11-29 03:30:04,464 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-29 03:30:04,464 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2023-11-29 03:30:04,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2023-11-29 03:30:04,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:04,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:04,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:30:04,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:04,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1218548506, now seen corresponding path program 1 times [2023-11-29 03:30:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698914303] [2023-11-29 03:30:04,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:04,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:04,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:04,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698914303] [2023-11-29 03:30:04,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698914303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:04,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:04,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:30:04,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962510938] [2023-11-29 03:30:04,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:04,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:30:04,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:04,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:30:04,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:30:04,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-29 03:30:04,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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) [2023-11-29 03:30:04,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:04,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-29 03:30:04,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:05,258 INFO L124 PetriNetUnfolderBase]: 983/1747 cut-off events. [2023-11-29 03:30:05,258 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2023-11-29 03:30:05,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3403 conditions, 1747 events. 983/1747 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11131 event pairs, 167 based on Foata normal form. 0/1690 useless extension candidates. Maximal degree in co-relation 3393. Up to 790 conditions per place. [2023-11-29 03:30:05,270 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 26 selfloop transitions, 2 changer transitions 39/80 dead transitions. [2023-11-29 03:30:05,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 316 flow [2023-11-29 03:30:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:30:05,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 03:30:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2023-11-29 03:30:05,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.615625 [2023-11-29 03:30:05,273 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 197 transitions. [2023-11-29 03:30:05,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 197 transitions. [2023-11-29 03:30:05,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:05,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 197 transitions. [2023-11-29 03:30:05,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 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) [2023-11-29 03:30:05,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:05,279 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:05,279 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 197 transitions. [2023-11-29 03:30:05,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 316 flow [2023-11-29 03:30:05,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:30:05,283 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 88 flow [2023-11-29 03:30:05,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2023-11-29 03:30:05,284 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-11-29 03:30:05,284 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 88 flow [2023-11-29 03:30:05,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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) [2023-11-29 03:30:05,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:05,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:05,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:30:05,285 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:05,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1671939278, now seen corresponding path program 1 times [2023-11-29 03:30:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:05,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501595862] [2023-11-29 03:30:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:05,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501595862] [2023-11-29 03:30:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501595862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:05,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:30:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482915051] [2023-11-29 03:30:05,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:05,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:30:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:30:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:30:05,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-29 03:30:05,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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) [2023-11-29 03:30:05,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:05,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-29 03:30:05,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:06,137 INFO L124 PetriNetUnfolderBase]: 874/1549 cut-off events. [2023-11-29 03:30:06,137 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2023-11-29 03:30:06,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3264 conditions, 1549 events. 874/1549 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9643 event pairs, 279 based on Foata normal form. 48/1587 useless extension candidates. Maximal degree in co-relation 3249. Up to 1057 conditions per place. [2023-11-29 03:30:06,150 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 28 selfloop transitions, 3 changer transitions 27/71 dead transitions. [2023-11-29 03:30:06,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 294 flow [2023-11-29 03:30:06,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:30:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 03:30:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2023-11-29 03:30:06,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2023-11-29 03:30:06,152 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 172 transitions. [2023-11-29 03:30:06,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 172 transitions. [2023-11-29 03:30:06,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:06,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 172 transitions. [2023-11-29 03:30:06,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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) [2023-11-29 03:30:06,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 40.0) internal successors, (320), 8 states have internal predecessors, (320), 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) [2023-11-29 03:30:06,156 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 40.0) internal successors, (320), 8 states have internal predecessors, (320), 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) [2023-11-29 03:30:06,156 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 88 flow. Second operand 7 states and 172 transitions. [2023-11-29 03:30:06,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 294 flow [2023-11-29 03:30:06,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 274 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 03:30:06,171 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 111 flow [2023-11-29 03:30:06,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2023-11-29 03:30:06,172 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2023-11-29 03:30:06,172 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 111 flow [2023-11-29 03:30:06,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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) [2023-11-29 03:30:06,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:06,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:06,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:30:06,173 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:06,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash 388292812, now seen corresponding path program 1 times [2023-11-29 03:30:06,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:06,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736446197] [2023-11-29 03:30:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:06,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:06,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:06,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736446197] [2023-11-29 03:30:06,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736446197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:06,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:06,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:30:06,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295051114] [2023-11-29 03:30:06,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:06,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:30:06,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:06,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:30:06,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:30:06,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-29 03:30:06,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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) [2023-11-29 03:30:06,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:06,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-29 03:30:06,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:07,364 INFO L124 PetriNetUnfolderBase]: 817/1451 cut-off events. [2023-11-29 03:30:07,364 INFO L125 PetriNetUnfolderBase]: For 1096/1096 co-relation queries the response was YES. [2023-11-29 03:30:07,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 1451 events. 817/1451 cut-off events. For 1096/1096 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8589 event pairs, 458 based on Foata normal form. 36/1477 useless extension candidates. Maximal degree in co-relation 3599. Up to 1048 conditions per place. [2023-11-29 03:30:07,375 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 33 selfloop transitions, 7 changer transitions 23/76 dead transitions. [2023-11-29 03:30:07,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 373 flow [2023-11-29 03:30:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:30:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 03:30:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2023-11-29 03:30:07,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.596875 [2023-11-29 03:30:07,377 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 191 transitions. [2023-11-29 03:30:07,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 191 transitions. [2023-11-29 03:30:07,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:07,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 191 transitions. [2023-11-29 03:30:07,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 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) [2023-11-29 03:30:07,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:07,380 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:07,380 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 111 flow. Second operand 8 states and 191 transitions. [2023-11-29 03:30:07,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 373 flow [2023-11-29 03:30:07,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 360 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-29 03:30:07,386 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 176 flow [2023-11-29 03:30:07,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-11-29 03:30:07,387 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2023-11-29 03:30:07,388 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 176 flow [2023-11-29 03:30:07,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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) [2023-11-29 03:30:07,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:07,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:07,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:30:07,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:07,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash 787459879, now seen corresponding path program 1 times [2023-11-29 03:30:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:07,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340163160] [2023-11-29 03:30:07,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:07,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:07,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:07,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340163160] [2023-11-29 03:30:07,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340163160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:07,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:07,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:30:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264552134] [2023-11-29 03:30:07,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:07,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:30:07,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:07,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:30:07,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:30:07,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-29 03:30:07,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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) [2023-11-29 03:30:07,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:07,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-29 03:30:07,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:08,015 INFO L124 PetriNetUnfolderBase]: 839/1510 cut-off events. [2023-11-29 03:30:08,015 INFO L125 PetriNetUnfolderBase]: For 3024/3069 co-relation queries the response was YES. [2023-11-29 03:30:08,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4574 conditions, 1510 events. 839/1510 cut-off events. For 3024/3069 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8972 event pairs, 214 based on Foata normal form. 41/1530 useless extension candidates. Maximal degree in co-relation 4553. Up to 880 conditions per place. [2023-11-29 03:30:08,039 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 41 selfloop transitions, 10 changer transitions 25/89 dead transitions. [2023-11-29 03:30:08,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 508 flow [2023-11-29 03:30:08,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:30:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 03:30:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2023-11-29 03:30:08,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.621875 [2023-11-29 03:30:08,041 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 199 transitions. [2023-11-29 03:30:08,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 199 transitions. [2023-11-29 03:30:08,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:08,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 199 transitions. [2023-11-29 03:30:08,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 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) [2023-11-29 03:30:08,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:08,044 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:08,044 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 176 flow. Second operand 8 states and 199 transitions. [2023-11-29 03:30:08,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 508 flow [2023-11-29 03:30:08,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 490 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-11-29 03:30:08,050 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 224 flow [2023-11-29 03:30:08,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2023-11-29 03:30:08,051 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2023-11-29 03:30:08,051 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 224 flow [2023-11-29 03:30:08,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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) [2023-11-29 03:30:08,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:08,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:08,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:30:08,052 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:08,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:08,053 INFO L85 PathProgramCache]: Analyzing trace with hash 378924901, now seen corresponding path program 2 times [2023-11-29 03:30:08,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:08,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771574107] [2023-11-29 03:30:08,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:08,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:08,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:08,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771574107] [2023-11-29 03:30:08,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771574107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:08,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:08,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:30:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209377478] [2023-11-29 03:30:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:08,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:30:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:30:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:30:08,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-29 03:30:08,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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) [2023-11-29 03:30:08,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:08,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-29 03:30:08,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:09,003 INFO L124 PetriNetUnfolderBase]: 841/1511 cut-off events. [2023-11-29 03:30:09,003 INFO L125 PetriNetUnfolderBase]: For 4456/4550 co-relation queries the response was YES. [2023-11-29 03:30:09,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5206 conditions, 1511 events. 841/1511 cut-off events. For 4456/4550 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8937 event pairs, 228 based on Foata normal form. 46/1536 useless extension candidates. Maximal degree in co-relation 5180. Up to 879 conditions per place. [2023-11-29 03:30:09,015 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 42 selfloop transitions, 12 changer transitions 34/101 dead transitions. [2023-11-29 03:30:09,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 676 flow [2023-11-29 03:30:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:30:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 03:30:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 241 transitions. [2023-11-29 03:30:09,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6025 [2023-11-29 03:30:09,017 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 241 transitions. [2023-11-29 03:30:09,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 241 transitions. [2023-11-29 03:30:09,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:09,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 241 transitions. [2023-11-29 03:30:09,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 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) [2023-11-29 03:30:09,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 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) [2023-11-29 03:30:09,019 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 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) [2023-11-29 03:30:09,019 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 224 flow. Second operand 10 states and 241 transitions. [2023-11-29 03:30:09,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 676 flow [2023-11-29 03:30:09,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 630 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-11-29 03:30:09,029 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 280 flow [2023-11-29 03:30:09,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2023-11-29 03:30:09,030 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2023-11-29 03:30:09,030 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 280 flow [2023-11-29 03:30:09,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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) [2023-11-29 03:30:09,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:09,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:09,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:30:09,031 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:09,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash -663345330, now seen corresponding path program 1 times [2023-11-29 03:30:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802031493] [2023-11-29 03:30:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:09,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:09,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802031493] [2023-11-29 03:30:09,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802031493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:09,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:09,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:30:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159463865] [2023-11-29 03:30:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:09,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:30:09,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:09,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:30:09,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:30:09,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2023-11-29 03:30:09,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 280 flow. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 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) [2023-11-29 03:30:09,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:09,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2023-11-29 03:30:09,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:10,029 INFO L124 PetriNetUnfolderBase]: 766/1356 cut-off events. [2023-11-29 03:30:10,029 INFO L125 PetriNetUnfolderBase]: For 6178/6316 co-relation queries the response was YES. [2023-11-29 03:30:10,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5432 conditions, 1356 events. 766/1356 cut-off events. For 6178/6316 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7670 event pairs, 202 based on Foata normal form. 42/1391 useless extension candidates. Maximal degree in co-relation 5402. Up to 855 conditions per place. [2023-11-29 03:30:10,042 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 44 selfloop transitions, 8 changer transitions 25/90 dead transitions. [2023-11-29 03:30:10,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 678 flow [2023-11-29 03:30:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:30:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 03:30:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2023-11-29 03:30:10,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.609375 [2023-11-29 03:30:10,044 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 195 transitions. [2023-11-29 03:30:10,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 195 transitions. [2023-11-29 03:30:10,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:10,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 195 transitions. [2023-11-29 03:30:10,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 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) [2023-11-29 03:30:10,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:10,046 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:10,046 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 280 flow. Second operand 8 states and 195 transitions. [2023-11-29 03:30:10,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 678 flow [2023-11-29 03:30:10,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 640 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-29 03:30:10,058 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 287 flow [2023-11-29 03:30:10,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2023-11-29 03:30:10,059 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2023-11-29 03:30:10,059 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 287 flow [2023-11-29 03:30:10,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 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) [2023-11-29 03:30:10,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:10,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:10,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:30:10,060 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:10,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:10,061 INFO L85 PathProgramCache]: Analyzing trace with hash -781720501, now seen corresponding path program 1 times [2023-11-29 03:30:10,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:10,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045320134] [2023-11-29 03:30:10,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:10,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:10,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045320134] [2023-11-29 03:30:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045320134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:10,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:30:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512182631] [2023-11-29 03:30:10,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:10,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:30:10,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:10,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:30:10,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:30:10,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-29 03:30:10,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 48 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 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) [2023-11-29 03:30:10,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:10,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-29 03:30:10,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:10,555 INFO L124 PetriNetUnfolderBase]: 1428/2345 cut-off events. [2023-11-29 03:30:10,556 INFO L125 PetriNetUnfolderBase]: For 8485/8549 co-relation queries the response was YES. [2023-11-29 03:30:10,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8415 conditions, 2345 events. 1428/2345 cut-off events. For 8485/8549 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13354 event pairs, 175 based on Foata normal form. 152/2413 useless extension candidates. Maximal degree in co-relation 8383. Up to 1215 conditions per place. [2023-11-29 03:30:10,581 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 57 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2023-11-29 03:30:10,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 76 transitions, 574 flow [2023-11-29 03:30:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:30:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 03:30:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2023-11-29 03:30:10,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66875 [2023-11-29 03:30:10,583 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 107 transitions. [2023-11-29 03:30:10,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 107 transitions. [2023-11-29 03:30:10,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:10,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 107 transitions. [2023-11-29 03:30:10,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.75) internal successors, (107), 4 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) [2023-11-29 03:30:10,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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) [2023-11-29 03:30:10,585 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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) [2023-11-29 03:30:10,585 INFO L175 Difference]: Start difference. First operand has 72 places, 48 transitions, 287 flow. Second operand 4 states and 107 transitions. [2023-11-29 03:30:10,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 76 transitions, 574 flow [2023-11-29 03:30:10,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 531 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-11-29 03:30:10,599 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 291 flow [2023-11-29 03:30:10,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-11-29 03:30:10,600 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2023-11-29 03:30:10,600 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 291 flow [2023-11-29 03:30:10,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 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) [2023-11-29 03:30:10,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:10,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:10,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:30:10,601 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:10,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash -215491072, now seen corresponding path program 1 times [2023-11-29 03:30:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:10,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099932633] [2023-11-29 03:30:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:10,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:10,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099932633] [2023-11-29 03:30:10,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099932633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:10,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:10,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:30:10,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815227127] [2023-11-29 03:30:10,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:10,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:30:10,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:10,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:30:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:30:10,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-29 03:30:10,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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) [2023-11-29 03:30:10,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:10,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-29 03:30:10,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:11,143 INFO L124 PetriNetUnfolderBase]: 1061/1802 cut-off events. [2023-11-29 03:30:11,143 INFO L125 PetriNetUnfolderBase]: For 5016/5067 co-relation queries the response was YES. [2023-11-29 03:30:11,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6260 conditions, 1802 events. 1061/1802 cut-off events. For 5016/5067 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9765 event pairs, 94 based on Foata normal form. 126/1846 useless extension candidates. Maximal degree in co-relation 6231. Up to 549 conditions per place. [2023-11-29 03:30:11,160 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 62 selfloop transitions, 8 changer transitions 0/84 dead transitions. [2023-11-29 03:30:11,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 607 flow [2023-11-29 03:30:11,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:30:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 03:30:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2023-11-29 03:30:11,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-11-29 03:30:11,162 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 136 transitions. [2023-11-29 03:30:11,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 136 transitions. [2023-11-29 03:30:11,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:11,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 136 transitions. [2023-11-29 03:30:11,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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) [2023-11-29 03:30:11,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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) [2023-11-29 03:30:11,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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) [2023-11-29 03:30:11,164 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 291 flow. Second operand 5 states and 136 transitions. [2023-11-29 03:30:11,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 607 flow [2023-11-29 03:30:11,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 555 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-11-29 03:30:11,172 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 296 flow [2023-11-29 03:30:11,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-11-29 03:30:11,173 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2023-11-29 03:30:11,173 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 296 flow [2023-11-29 03:30:11,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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) [2023-11-29 03:30:11,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:11,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:11,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:30:11,173 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:11,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:11,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1861873401, now seen corresponding path program 1 times [2023-11-29 03:30:11,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:11,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693007499] [2023-11-29 03:30:11,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:11,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:11,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693007499] [2023-11-29 03:30:11,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693007499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:11,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:30:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023703421] [2023-11-29 03:30:11,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:11,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:30:11,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:11,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:30:11,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:30:11,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-29 03:30:11,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 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) [2023-11-29 03:30:11,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:11,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-29 03:30:11,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:11,657 INFO L124 PetriNetUnfolderBase]: 817/1390 cut-off events. [2023-11-29 03:30:11,657 INFO L125 PetriNetUnfolderBase]: For 3931/3963 co-relation queries the response was YES. [2023-11-29 03:30:11,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4962 conditions, 1390 events. 817/1390 cut-off events. For 3931/3963 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7185 event pairs, 94 based on Foata normal form. 65/1372 useless extension candidates. Maximal degree in co-relation 4933. Up to 483 conditions per place. [2023-11-29 03:30:11,668 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 57 selfloop transitions, 11 changer transitions 0/82 dead transitions. [2023-11-29 03:30:11,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 561 flow [2023-11-29 03:30:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:30:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 03:30:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2023-11-29 03:30:11,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2023-11-29 03:30:11,670 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 149 transitions. [2023-11-29 03:30:11,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 149 transitions. [2023-11-29 03:30:11,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:11,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 149 transitions. [2023-11-29 03:30:11,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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) [2023-11-29 03:30:11,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 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) [2023-11-29 03:30:11,673 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 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) [2023-11-29 03:30:11,673 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 296 flow. Second operand 6 states and 149 transitions. [2023-11-29 03:30:11,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 561 flow [2023-11-29 03:30:11,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 519 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-11-29 03:30:11,681 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 302 flow [2023-11-29 03:30:11,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2023-11-29 03:30:11,682 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2023-11-29 03:30:11,682 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 302 flow [2023-11-29 03:30:11,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 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) [2023-11-29 03:30:11,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:11,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:11,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:30:11,683 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:11,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 259693209, now seen corresponding path program 1 times [2023-11-29 03:30:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:11,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050359495] [2023-11-29 03:30:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:12,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050359495] [2023-11-29 03:30:12,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050359495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:12,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:12,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:30:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860905660] [2023-11-29 03:30:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:12,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:30:12,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:12,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:30:12,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:30:12,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-29 03:30:12,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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) [2023-11-29 03:30:12,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:12,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-29 03:30:12,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:12,702 INFO L124 PetriNetUnfolderBase]: 1256/2335 cut-off events. [2023-11-29 03:30:12,702 INFO L125 PetriNetUnfolderBase]: For 5356/5949 co-relation queries the response was YES. [2023-11-29 03:30:12,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7269 conditions, 2335 events. 1256/2335 cut-off events. For 5356/5949 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14800 event pairs, 312 based on Foata normal form. 70/2211 useless extension candidates. Maximal degree in co-relation 7240. Up to 1009 conditions per place. [2023-11-29 03:30:12,719 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 43 selfloop transitions, 4 changer transitions 43/112 dead transitions. [2023-11-29 03:30:12,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 112 transitions, 729 flow [2023-11-29 03:30:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:30:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 03:30:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2023-11-29 03:30:12,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54375 [2023-11-29 03:30:12,722 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 174 transitions. [2023-11-29 03:30:12,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 174 transitions. [2023-11-29 03:30:12,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:12,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 174 transitions. [2023-11-29 03:30:12,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 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) [2023-11-29 03:30:12,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:12,724 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:12,724 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 302 flow. Second operand 8 states and 174 transitions. [2023-11-29 03:30:12,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 112 transitions, 729 flow [2023-11-29 03:30:12,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 112 transitions, 669 flow, removed 24 selfloop flow, removed 7 redundant places. [2023-11-29 03:30:12,753 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 305 flow [2023-11-29 03:30:12,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=305, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2023-11-29 03:30:12,753 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2023-11-29 03:30:12,754 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 305 flow [2023-11-29 03:30:12,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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) [2023-11-29 03:30:12,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:12,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:12,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:30:12,754 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:12,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1773549921, now seen corresponding path program 2 times [2023-11-29 03:30:12,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:12,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206816413] [2023-11-29 03:30:12,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:12,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:13,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:13,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206816413] [2023-11-29 03:30:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206816413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:13,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:30:13,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736632361] [2023-11-29 03:30:13,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:13,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:30:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:13,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:30:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:30:13,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-29 03:30:13,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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) [2023-11-29 03:30:13,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:13,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-29 03:30:13,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:13,810 INFO L124 PetriNetUnfolderBase]: 1073/2072 cut-off events. [2023-11-29 03:30:13,810 INFO L125 PetriNetUnfolderBase]: For 2499/2789 co-relation queries the response was YES. [2023-11-29 03:30:13,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5871 conditions, 2072 events. 1073/2072 cut-off events. For 2499/2789 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13953 event pairs, 216 based on Foata normal form. 49/1926 useless extension candidates. Maximal degree in co-relation 5840. Up to 822 conditions per place. [2023-11-29 03:30:13,820 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 29 selfloop transitions, 3 changer transitions 37/89 dead transitions. [2023-11-29 03:30:13,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 562 flow [2023-11-29 03:30:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:30:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 03:30:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2023-11-29 03:30:13,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503125 [2023-11-29 03:30:13,822 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 161 transitions. [2023-11-29 03:30:13,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 161 transitions. [2023-11-29 03:30:13,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:13,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 161 transitions. [2023-11-29 03:30:13,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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) [2023-11-29 03:30:13,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:13,824 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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) [2023-11-29 03:30:13,824 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 305 flow. Second operand 8 states and 161 transitions. [2023-11-29 03:30:13,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 562 flow [2023-11-29 03:30:13,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 542 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-29 03:30:13,839 INFO L231 Difference]: Finished difference. Result has 79 places, 45 transitions, 238 flow [2023-11-29 03:30:13,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=79, PETRI_TRANSITIONS=45} [2023-11-29 03:30:13,840 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2023-11-29 03:30:13,840 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 45 transitions, 238 flow [2023-11-29 03:30:13,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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) [2023-11-29 03:30:13,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:13,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:13,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:30:13,841 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:13,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash -482465631, now seen corresponding path program 3 times [2023-11-29 03:30:13,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:13,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069927652] [2023-11-29 03:30:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:30:15,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:30:15,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069927652] [2023-11-29 03:30:15,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069927652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:30:15,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:30:15,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 03:30:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825351806] [2023-11-29 03:30:15,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:30:15,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:30:15,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:30:15,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:30:15,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:30:15,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-29 03:30:15,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 45 transitions, 238 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 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) [2023-11-29 03:30:15,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:30:15,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-29 03:30:15,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:30:15,678 INFO L124 PetriNetUnfolderBase]: 818/1678 cut-off events. [2023-11-29 03:30:15,678 INFO L125 PetriNetUnfolderBase]: For 1943/2239 co-relation queries the response was YES. [2023-11-29 03:30:15,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4796 conditions, 1678 events. 818/1678 cut-off events. For 1943/2239 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10895 event pairs, 201 based on Foata normal form. 32/1566 useless extension candidates. Maximal degree in co-relation 4763. Up to 549 conditions per place. [2023-11-29 03:30:15,686 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 31 selfloop transitions, 6 changer transitions 30/86 dead transitions. [2023-11-29 03:30:15,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 86 transitions, 509 flow [2023-11-29 03:30:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:30:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 03:30:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2023-11-29 03:30:15,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2023-11-29 03:30:15,688 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 183 transitions. [2023-11-29 03:30:15,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 183 transitions. [2023-11-29 03:30:15,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:30:15,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 183 transitions. [2023-11-29 03:30:15,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 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) [2023-11-29 03:30:15,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 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) [2023-11-29 03:30:15,690 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 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) [2023-11-29 03:30:15,690 INFO L175 Difference]: Start difference. First operand has 79 places, 45 transitions, 238 flow. Second operand 9 states and 183 transitions. [2023-11-29 03:30:15,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 86 transitions, 509 flow [2023-11-29 03:30:15,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 86 transitions, 471 flow, removed 11 selfloop flow, removed 11 redundant places. [2023-11-29 03:30:15,699 INFO L231 Difference]: Finished difference. Result has 74 places, 44 transitions, 232 flow [2023-11-29 03:30:15,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=74, PETRI_TRANSITIONS=44} [2023-11-29 03:30:15,700 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2023-11-29 03:30:15,700 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 44 transitions, 232 flow [2023-11-29 03:30:15,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 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) [2023-11-29 03:30:15,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:30:15,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:15,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:30:15,701 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:30:15,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1431875107, now seen corresponding path program 4 times [2023-11-29 03:30:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:30:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381440385] [2023-11-29 03:30:15,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:15,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:30:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:30:15,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:30:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:30:15,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:30:15,817 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:30:15,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-29 03:30:15,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-29 03:30:15,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-29 03:30:15,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-29 03:30:15,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-29 03:30:15,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-29 03:30:15,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:30:15,821 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:30:15,827 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 03:30:15,827 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:30:15,881 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 03:30:15,882 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 03:30:15,883 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 03:30:15,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:30:15 BasicIcfg [2023-11-29 03:30:15,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:30:15,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:30:15,907 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:30:15,907 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:30:15,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:30:03" (3/4) ... [2023-11-29 03:30:15,909 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 03:30:15,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 03:30:15,931 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 03:30:15,932 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 03:30:16,001 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 03:30:16,001 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:30:16,002 INFO L158 Benchmark]: Toolchain (without parser) took 13746.12ms. Allocated memory was 161.5MB in the beginning and 390.1MB in the end (delta: 228.6MB). Free memory was 132.7MB in the beginning and 339.7MB in the end (delta: -207.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2023-11-29 03:30:16,002 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:30:16,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.76ms. Allocated memory is still 161.5MB. Free memory was 132.7MB in the beginning and 108.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 03:30:16,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.23ms. Allocated memory is still 161.5MB. Free memory was 108.9MB in the beginning and 106.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:30:16,003 INFO L158 Benchmark]: Boogie Preprocessor took 50.06ms. Allocated memory is still 161.5MB. Free memory was 106.2MB in the beginning and 102.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:30:16,003 INFO L158 Benchmark]: RCFGBuilder took 651.09ms. Allocated memory is still 161.5MB. Free memory was 102.9MB in the beginning and 53.7MB in the end (delta: 49.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-29 03:30:16,004 INFO L158 Benchmark]: TraceAbstraction took 12434.43ms. Allocated memory was 161.5MB in the beginning and 390.1MB in the end (delta: 228.6MB). Free memory was 53.1MB in the beginning and 352.3MB in the end (delta: -299.1MB). Peak memory consumption was 160.6MB. Max. memory is 16.1GB. [2023-11-29 03:30:16,004 INFO L158 Benchmark]: Witness Printer took 94.13ms. Allocated memory is still 390.1MB. Free memory was 352.3MB in the beginning and 339.7MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 03:30:16,006 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.17ms. Allocated memory is still 107.0MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.76ms. Allocated memory is still 161.5MB. Free memory was 132.7MB in the beginning and 108.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.23ms. Allocated memory is still 161.5MB. Free memory was 108.9MB in the beginning and 106.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.06ms. Allocated memory is still 161.5MB. Free memory was 106.2MB in the beginning and 102.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 651.09ms. Allocated memory is still 161.5MB. Free memory was 102.9MB in the beginning and 53.7MB in the end (delta: 49.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12434.43ms. Allocated memory was 161.5MB in the beginning and 390.1MB in the end (delta: 228.6MB). Free memory was 53.1MB in the beginning and 352.3MB in the end (delta: -299.1MB). Peak memory consumption was 160.6MB. Max. memory is 16.1GB. * Witness Printer took 94.13ms. Allocated memory is still 390.1MB. Free memory was 352.3MB in the beginning and 339.7MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L751] 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) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 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 [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 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) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 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 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L803] 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) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 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 [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 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) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 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 [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 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 [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 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) [L848] 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)) [L849] 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)) [L850] 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)) [L851] 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)) [L852] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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: 826]: 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: 830]: 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: 828]: 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 7 procedures, 66 locations, 6 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: 12.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 635 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 603 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1898 IncrementalHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 52 mSDtfsCounter, 1898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=11, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 2264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 03:30:16,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cffe1a57-0c96-48e5-aa05-2ebf741ced54/bin/uautomizer-verify-BQ2R08f2Ya/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