./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/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_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/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_dd98cf59-64ae-4ed2-a8be-73c291d2233f/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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:37:52,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:37:52,986 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:37:52,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:37:52,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:37:53,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:37:53,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:37:53,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:37:53,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:37:53,017 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:37:53,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:37:53,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:37:53,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:37:53,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:37:53,020 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:37:53,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:37:53,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:37:53,022 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:37:53,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:37:53,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:37:53,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:37:53,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:37:53,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:37:53,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:37:53,025 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:37:53,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:37:53,026 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:37:53,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:37:53,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:37:53,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:37:53,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:37:53,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:37:53,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:37:53,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:37:53,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:37:53,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:37:53,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:37:53,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:37:53,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:37:53,030 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:37:53,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:37:53,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:37:53,031 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_dd98cf59-64ae-4ed2-a8be-73c291d2233f/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_dd98cf59-64ae-4ed2-a8be-73c291d2233f/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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2023-11-29 01:37:53,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:37:53,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:37:53,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:37:53,253 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:37:53,254 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:37:53,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-29 01:37:55,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:37:56,198 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:37:56,199 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-29 01:37:56,215 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/data/a664095dc/063475dbb9bd4a6687e43426af396904/FLAG501ff94a3 [2023-11-29 01:37:56,229 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/data/a664095dc/063475dbb9bd4a6687e43426af396904 [2023-11-29 01:37:56,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:37:56,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:37:56,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:37:56,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:37:56,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:37:56,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66fce3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56, skipping insertion in model container [2023-11-29 01:37:56,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,288 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:37:56,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_dd98cf59-64ae-4ed2-a8be-73c291d2233f/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-11-29 01:37:56,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:37:56,621 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:37:56,633 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_dd98cf59-64ae-4ed2-a8be-73c291d2233f/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-11-29 01:37:56,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:37:56,707 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:37:56,707 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:37:56,714 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:37:56,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56 WrapperNode [2023-11-29 01:37:56,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:37:56,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:37:56,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:37:56,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:37:56,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,769 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-29 01:37:56,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:37:56,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:37:56,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:37:56,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:37:56,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,797 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 01:37:56,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:37:56,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:37:56,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:37:56,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:37:56,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (1/1) ... [2023-11-29 01:37:56,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:37:56,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:37:56,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:37:56,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:37:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:37:56,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:37:56,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:37:56,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 01:37:56,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 01:37:56,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:37:56,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:37:56,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:37:56,878 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 01:37:56,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 01:37:56,878 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 01:37:56,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 01:37:56,878 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 01:37:56,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 01:37:56,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:37:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:37:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:37:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 01:37:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 01:37:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:37:56,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:37:56,881 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 01:37:57,012 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:37:57,014 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:37:57,284 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:37:57,485 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:37:57,485 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 01:37:57,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:37:57 BoogieIcfgContainer [2023-11-29 01:37:57,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:37:57,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:37:57,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:37:57,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:37:57,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:37:56" (1/3) ... [2023-11-29 01:37:57,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66160323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:37:57, skipping insertion in model container [2023-11-29 01:37:57,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:37:56" (2/3) ... [2023-11-29 01:37:57,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66160323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:37:57, skipping insertion in model container [2023-11-29 01:37:57,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:37:57" (3/3) ... [2023-11-29 01:37:57,494 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-29 01:37:57,500 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 01:37:57,508 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:37:57,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 01:37:57,509 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:37:57,548 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 01:37:57,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2023-11-29 01:37:57,601 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-11-29 01:37:57,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:37:57,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-29 01:37:57,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2023-11-29 01:37:57,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2023-11-29 01:37:57,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:37:57,622 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;@452f15fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:37:57,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 01:37:57,626 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:37:57,627 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-29 01:37:57,627 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:37:57,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:37:57,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-29 01:37:57,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:37:57,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash 11139069, now seen corresponding path program 1 times [2023-11-29 01:37:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:57,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518416846] [2023-11-29 01:37:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:57,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:57,968 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 01:37:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:57,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518416846] [2023-11-29 01:37:57,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518416846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:57,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:57,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:37:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153387941] [2023-11-29 01:37:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:57,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:37:57,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:37:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:37:58,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2023-11-29 01:37:58,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 01:37:58,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:37:58,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2023-11-29 01:37:58,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:37:58,286 INFO L124 PetriNetUnfolderBase]: 530/980 cut-off events. [2023-11-29 01:37:58,286 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-29 01:37:58,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 980 events. 530/980 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5537 event pairs, 284 based on Foata normal form. 36/992 useless extension candidates. Maximal degree in co-relation 1823. Up to 664 conditions per place. [2023-11-29 01:37:58,296 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-29 01:37:58,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2023-11-29 01:37:58,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:37:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:37:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2023-11-29 01:37:58,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2023-11-29 01:37:58,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 90 transitions. [2023-11-29 01:37:58,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 90 transitions. [2023-11-29 01:37:58,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:37:58,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 90 transitions. [2023-11-29 01:37:58,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.0) internal successors, (90), 3 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 01:37:58,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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 01:37:58,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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 01:37:58,317 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 90 transitions. [2023-11-29 01:37:58,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2023-11-29 01:37:58,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 01:37:58,321 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2023-11-29 01:37:58,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, 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=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-29 01:37:58,327 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2023-11-29 01:37:58,327 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2023-11-29 01:37:58,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 01:37:58,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:37:58,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:58,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:37:58,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:37:58,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1800742136, now seen corresponding path program 1 times [2023-11-29 01:37:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602394036] [2023-11-29 01:37:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:58,617 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 01:37:58,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:58,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602394036] [2023-11-29 01:37:58,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602394036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:58,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:58,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:37:58,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044739340] [2023-11-29 01:37:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:58,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:37:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:58,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:37:58,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:37:58,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-29 01:37:58,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 01:37:58,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:37:58,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-29 01:37:58,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:37:59,084 INFO L124 PetriNetUnfolderBase]: 1356/2342 cut-off events. [2023-11-29 01:37:59,084 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-29 01:37:59,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4571 conditions, 2342 events. 1356/2342 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15572 event pairs, 354 based on Foata normal form. 0/2274 useless extension candidates. Maximal degree in co-relation 4561. Up to 1288 conditions per place. [2023-11-29 01:37:59,098 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 30 selfloop transitions, 3 changer transitions 43/87 dead transitions. [2023-11-29 01:37:59,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 87 transitions, 352 flow [2023-11-29 01:37:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:37:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 01:37:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2023-11-29 01:37:59,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2023-11-29 01:37:59,102 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 190 transitions. [2023-11-29 01:37:59,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 190 transitions. [2023-11-29 01:37:59,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:37:59,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 190 transitions. [2023-11-29 01:37:59,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 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 01:37:59,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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 01:37:59,107 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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 01:37:59,107 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 190 transitions. [2023-11-29 01:37:59,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 87 transitions, 352 flow [2023-11-29 01:37:59,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 87 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:37:59,111 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 105 flow [2023-11-29 01:37:59,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=8, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-11-29 01:37:59,112 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-11-29 01:37:59,112 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 105 flow [2023-11-29 01:37:59,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 01:37:59,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:37:59,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:37:59,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:37:59,113 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:37:59,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:37:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1118530345, now seen corresponding path program 1 times [2023-11-29 01:37:59,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:37:59,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603002492] [2023-11-29 01:37:59,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:37:59,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:37:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:37:59,967 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 01:37:59,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:37:59,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603002492] [2023-11-29 01:37:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603002492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:59,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:59,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:37:59,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766925863] [2023-11-29 01:37:59,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:59,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:37:59,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:37:59,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:37:59,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:37:59,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-29 01:37:59,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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 01:37:59,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:37:59,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-29 01:37:59,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:00,740 INFO L124 PetriNetUnfolderBase]: 1564/2688 cut-off events. [2023-11-29 01:38:00,740 INFO L125 PetriNetUnfolderBase]: For 1726/1726 co-relation queries the response was YES. [2023-11-29 01:38:00,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6389 conditions, 2688 events. 1564/2688 cut-off events. For 1726/1726 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16516 event pairs, 265 based on Foata normal form. 84/2756 useless extension candidates. Maximal degree in co-relation 6374. Up to 1376 conditions per place. [2023-11-29 01:38:00,758 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 38 selfloop transitions, 9 changer transitions 51/108 dead transitions. [2023-11-29 01:38:00,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 557 flow [2023-11-29 01:38:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:38:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 01:38:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2023-11-29 01:38:00,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5820512820512821 [2023-11-29 01:38:00,761 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 227 transitions. [2023-11-29 01:38:00,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 227 transitions. [2023-11-29 01:38:00,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:00,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 227 transitions. [2023-11-29 01:38:00,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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 01:38:00,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 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 01:38:00,765 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 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 01:38:00,765 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 105 flow. Second operand 10 states and 227 transitions. [2023-11-29 01:38:00,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 557 flow [2023-11-29 01:38:00,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 538 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-29 01:38:00,778 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 212 flow [2023-11-29 01:38:00,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=212, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2023-11-29 01:38:00,779 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2023-11-29 01:38:00,779 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 212 flow [2023-11-29 01:38:00,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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 01:38:00,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:00,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:38:00,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:38:00,780 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:00,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash -672310628, now seen corresponding path program 1 times [2023-11-29 01:38:00,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:00,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768375365] [2023-11-29 01:38:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:00,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:01,399 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 01:38:01,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:01,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768375365] [2023-11-29 01:38:01,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768375365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:01,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:01,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:38:01,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311852799] [2023-11-29 01:38:01,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:01,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:38:01,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:01,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:38:01,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:38:01,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2023-11-29 01:38:01,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 01:38:01,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:01,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2023-11-29 01:38:01,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:02,566 INFO L124 PetriNetUnfolderBase]: 2132/3458 cut-off events. [2023-11-29 01:38:02,566 INFO L125 PetriNetUnfolderBase]: For 9621/9630 co-relation queries the response was YES. [2023-11-29 01:38:02,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12381 conditions, 3458 events. 2132/3458 cut-off events. For 9621/9630 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 21079 event pairs, 218 based on Foata normal form. 91/3536 useless extension candidates. Maximal degree in co-relation 12358. Up to 1470 conditions per place. [2023-11-29 01:38:02,607 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 57 selfloop transitions, 30 changer transitions 80/176 dead transitions. [2023-11-29 01:38:02,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 176 transitions, 1344 flow [2023-11-29 01:38:02,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:38:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 01:38:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 302 transitions. [2023-11-29 01:38:02,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5956607495069034 [2023-11-29 01:38:02,610 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 302 transitions. [2023-11-29 01:38:02,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 302 transitions. [2023-11-29 01:38:02,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:02,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 302 transitions. [2023-11-29 01:38:02,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 23.23076923076923) internal successors, (302), 13 states have internal predecessors, (302), 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 01:38:02,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 39.0) internal successors, (546), 14 states have internal predecessors, (546), 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 01:38:02,615 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 39.0) internal successors, (546), 14 states have internal predecessors, (546), 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 01:38:02,615 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 212 flow. Second operand 13 states and 302 transitions. [2023-11-29 01:38:02,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 176 transitions, 1344 flow [2023-11-29 01:38:02,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 176 transitions, 1281 flow, removed 29 selfloop flow, removed 5 redundant places. [2023-11-29 01:38:02,672 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 550 flow [2023-11-29 01:38:02,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=550, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-11-29 01:38:02,673 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-11-29 01:38:02,673 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 550 flow [2023-11-29 01:38:02,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 01:38:02,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:02,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:38:02,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:38:02,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:02,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash -12784772, now seen corresponding path program 2 times [2023-11-29 01:38:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:02,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928324996] [2023-11-29 01:38:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:02,910 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 01:38:02,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:02,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928324996] [2023-11-29 01:38:02,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928324996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:02,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:02,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:38:02,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116451235] [2023-11-29 01:38:02,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:02,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:38:02,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:02,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:38:02,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:38:02,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-29 01:38:02,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 01:38:02,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:02,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-29 01:38:02,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:03,701 INFO L124 PetriNetUnfolderBase]: 2191/3629 cut-off events. [2023-11-29 01:38:03,701 INFO L125 PetriNetUnfolderBase]: For 31605/31912 co-relation queries the response was YES. [2023-11-29 01:38:03,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19204 conditions, 3629 events. 2191/3629 cut-off events. For 31605/31912 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 22780 event pairs, 294 based on Foata normal form. 190/3727 useless extension candidates. Maximal degree in co-relation 19172. Up to 1461 conditions per place. [2023-11-29 01:38:03,738 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 44 selfloop transitions, 5 changer transitions 63/129 dead transitions. [2023-11-29 01:38:03,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 129 transitions, 1415 flow [2023-11-29 01:38:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:38:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 01:38:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2023-11-29 01:38:03,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2023-11-29 01:38:03,740 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 186 transitions. [2023-11-29 01:38:03,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 186 transitions. [2023-11-29 01:38:03,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:03,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 186 transitions. [2023-11-29 01:38:03,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 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 01:38:03,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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 01:38:03,743 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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 01:38:03,743 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 550 flow. Second operand 8 states and 186 transitions. [2023-11-29 01:38:03,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 129 transitions, 1415 flow [2023-11-29 01:38:03,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 129 transitions, 1379 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-11-29 01:38:03,780 INFO L231 Difference]: Finished difference. Result has 75 places, 50 transitions, 418 flow [2023-11-29 01:38:03,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=418, PETRI_PLACES=75, PETRI_TRANSITIONS=50} [2023-11-29 01:38:03,781 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2023-11-29 01:38:03,782 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 50 transitions, 418 flow [2023-11-29 01:38:03,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 01:38:03,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:03,782 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 01:38:03,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:38:03,782 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:03,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:03,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1828524151, now seen corresponding path program 1 times [2023-11-29 01:38:03,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:03,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665590673] [2023-11-29 01:38:03,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:04,180 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 01:38:04,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:04,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665590673] [2023-11-29 01:38:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665590673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:04,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:38:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941625241] [2023-11-29 01:38:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:04,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:38:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:04,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:38:04,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:38:04,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-29 01:38:04,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 50 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 01:38:04,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:04,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-29 01:38:04,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:04,778 INFO L124 PetriNetUnfolderBase]: 1399/2356 cut-off events. [2023-11-29 01:38:04,778 INFO L125 PetriNetUnfolderBase]: For 21315/21392 co-relation queries the response was YES. [2023-11-29 01:38:04,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12688 conditions, 2356 events. 1399/2356 cut-off events. For 21315/21392 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13604 event pairs, 588 based on Foata normal form. 127/2433 useless extension candidates. Maximal degree in co-relation 12652. Up to 1570 conditions per place. [2023-11-29 01:38:04,841 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 38 selfloop transitions, 4 changer transitions 33/95 dead transitions. [2023-11-29 01:38:04,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 95 transitions, 952 flow [2023-11-29 01:38:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:38:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 01:38:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2023-11-29 01:38:04,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6043956043956044 [2023-11-29 01:38:04,843 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 165 transitions. [2023-11-29 01:38:04,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 165 transitions. [2023-11-29 01:38:04,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:04,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 165 transitions. [2023-11-29 01:38:04,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 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 01:38:04,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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 01:38:04,845 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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 01:38:04,846 INFO L175 Difference]: Start difference. First operand has 75 places, 50 transitions, 418 flow. Second operand 7 states and 165 transitions. [2023-11-29 01:38:04,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 95 transitions, 952 flow [2023-11-29 01:38:04,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 864 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-11-29 01:38:04,876 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 401 flow [2023-11-29 01:38:04,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2023-11-29 01:38:04,877 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2023-11-29 01:38:04,877 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 401 flow [2023-11-29 01:38:04,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 01:38:04,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:04,878 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 01:38:04,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:38:04,878 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:04,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1156639484, now seen corresponding path program 1 times [2023-11-29 01:38:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:04,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717579335] [2023-11-29 01:38:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:05,232 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 01:38:05,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:05,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717579335] [2023-11-29 01:38:05,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717579335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:05,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:38:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160498855] [2023-11-29 01:38:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:05,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:38:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:05,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:38:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:38:05,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-29 01:38:05,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 401 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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 01:38:05,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:05,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-29 01:38:05,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:05,878 INFO L124 PetriNetUnfolderBase]: 1357/2285 cut-off events. [2023-11-29 01:38:05,878 INFO L125 PetriNetUnfolderBase]: For 21838/21904 co-relation queries the response was YES. [2023-11-29 01:38:05,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12673 conditions, 2285 events. 1357/2285 cut-off events. For 21838/21904 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13091 event pairs, 616 based on Foata normal form. 103/2337 useless extension candidates. Maximal degree in co-relation 12640. Up to 1425 conditions per place. [2023-11-29 01:38:05,898 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 45 selfloop transitions, 9 changer transitions 31/105 dead transitions. [2023-11-29 01:38:05,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 105 transitions, 1080 flow [2023-11-29 01:38:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:38:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 01:38:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2023-11-29 01:38:05,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2023-11-29 01:38:05,900 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 189 transitions. [2023-11-29 01:38:05,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 189 transitions. [2023-11-29 01:38:05,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:05,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 189 transitions. [2023-11-29 01:38:05,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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 01:38:05,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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 01:38:05,902 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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 01:38:05,902 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 401 flow. Second operand 8 states and 189 transitions. [2023-11-29 01:38:05,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 105 transitions, 1080 flow [2023-11-29 01:38:05,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 105 transitions, 1058 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-11-29 01:38:05,918 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 488 flow [2023-11-29 01:38:05,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=488, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2023-11-29 01:38:05,919 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2023-11-29 01:38:05,919 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 488 flow [2023-11-29 01:38:05,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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 01:38:05,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:05,920 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 01:38:05,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:38:05,920 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:05,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1619116716, now seen corresponding path program 2 times [2023-11-29 01:38:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:05,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670831009] [2023-11-29 01:38:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:05,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:06,202 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 01:38:06,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:06,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670831009] [2023-11-29 01:38:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670831009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:06,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:06,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:38:06,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900329315] [2023-11-29 01:38:06,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:06,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:38:06,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:38:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:38:06,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-29 01:38:06,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 56 transitions, 488 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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 01:38:06,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:06,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-29 01:38:06,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:06,750 INFO L124 PetriNetUnfolderBase]: 1294/2196 cut-off events. [2023-11-29 01:38:06,750 INFO L125 PetriNetUnfolderBase]: For 24623/24689 co-relation queries the response was YES. [2023-11-29 01:38:06,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12646 conditions, 2196 events. 1294/2196 cut-off events. For 24623/24689 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12425 event pairs, 580 based on Foata normal form. 103/2248 useless extension candidates. Maximal degree in co-relation 12609. Up to 1398 conditions per place. [2023-11-29 01:38:06,773 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 42 selfloop transitions, 9 changer transitions 31/102 dead transitions. [2023-11-29 01:38:06,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 102 transitions, 1089 flow [2023-11-29 01:38:06,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:38:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 01:38:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2023-11-29 01:38:06,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2023-11-29 01:38:06,774 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 186 transitions. [2023-11-29 01:38:06,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 186 transitions. [2023-11-29 01:38:06,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:06,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 186 transitions. [2023-11-29 01:38:06,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 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 01:38:06,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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 01:38:06,776 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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 01:38:06,776 INFO L175 Difference]: Start difference. First operand has 77 places, 56 transitions, 488 flow. Second operand 8 states and 186 transitions. [2023-11-29 01:38:06,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 102 transitions, 1089 flow [2023-11-29 01:38:06,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 102 transitions, 1006 flow, removed 38 selfloop flow, removed 5 redundant places. [2023-11-29 01:38:06,799 INFO L231 Difference]: Finished difference. Result has 80 places, 56 transitions, 455 flow [2023-11-29 01:38:06,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=455, PETRI_PLACES=80, PETRI_TRANSITIONS=56} [2023-11-29 01:38:06,800 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2023-11-29 01:38:06,800 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 56 transitions, 455 flow [2023-11-29 01:38:06,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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 01:38:06,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:06,801 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 01:38:06,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:38:06,801 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:06,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1885692369, now seen corresponding path program 1 times [2023-11-29 01:38:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:06,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568247706] [2023-11-29 01:38:06,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:06,929 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 01:38:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:06,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568247706] [2023-11-29 01:38:06,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568247706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:06,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:06,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:38:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971375967] [2023-11-29 01:38:06,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:06,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:38:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:38:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:38:06,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-29 01:38:06,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 56 transitions, 455 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 01:38:06,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:06,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-29 01:38:06,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:07,411 INFO L124 PetriNetUnfolderBase]: 2222/3487 cut-off events. [2023-11-29 01:38:07,411 INFO L125 PetriNetUnfolderBase]: For 43820/44232 co-relation queries the response was YES. [2023-11-29 01:38:07,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18691 conditions, 3487 events. 2222/3487 cut-off events. For 43820/44232 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19053 event pairs, 372 based on Foata normal form. 348/3651 useless extension candidates. Maximal degree in co-relation 18652. Up to 1685 conditions per place. [2023-11-29 01:38:07,432 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 68 selfloop transitions, 5 changer transitions 0/92 dead transitions. [2023-11-29 01:38:07,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 92 transitions, 926 flow [2023-11-29 01:38:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:38:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 01:38:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2023-11-29 01:38:07,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2023-11-29 01:38:07,433 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 103 transitions. [2023-11-29 01:38:07,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 103 transitions. [2023-11-29 01:38:07,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:07,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 103 transitions. [2023-11-29 01:38:07,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 01:38:07,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 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 01:38:07,434 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 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 01:38:07,434 INFO L175 Difference]: Start difference. First operand has 80 places, 56 transitions, 455 flow. Second operand 4 states and 103 transitions. [2023-11-29 01:38:07,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 92 transitions, 926 flow [2023-11-29 01:38:07,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 92 transitions, 870 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-11-29 01:38:07,446 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 452 flow [2023-11-29 01:38:07,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=452, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2023-11-29 01:38:07,447 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-11-29 01:38:07,447 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 452 flow [2023-11-29 01:38:07,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 01:38:07,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:07,448 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] [2023-11-29 01:38:07,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:38:07,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:07,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash -570294070, now seen corresponding path program 1 times [2023-11-29 01:38:07,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:07,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635762917] [2023-11-29 01:38:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:07,609 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 01:38:07,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635762917] [2023-11-29 01:38:07,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635762917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:07,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:07,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:38:07,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718280932] [2023-11-29 01:38:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:07,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:38:07,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:07,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:38:07,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:38:07,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-29 01:38:07,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 452 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 01:38:07,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:07,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-29 01:38:07,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:08,050 INFO L124 PetriNetUnfolderBase]: 1622/2583 cut-off events. [2023-11-29 01:38:08,050 INFO L125 PetriNetUnfolderBase]: For 30941/31210 co-relation queries the response was YES. [2023-11-29 01:38:08,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13680 conditions, 2583 events. 1622/2583 cut-off events. For 30941/31210 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13435 event pairs, 232 based on Foata normal form. 278/2690 useless extension candidates. Maximal degree in co-relation 13643. Up to 957 conditions per place. [2023-11-29 01:38:08,069 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 72 selfloop transitions, 8 changer transitions 0/99 dead transitions. [2023-11-29 01:38:08,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 970 flow [2023-11-29 01:38:08,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:38:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:38:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2023-11-29 01:38:08,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2023-11-29 01:38:08,071 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 131 transitions. [2023-11-29 01:38:08,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 131 transitions. [2023-11-29 01:38:08,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:08,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 131 transitions. [2023-11-29 01:38:08,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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 01:38:08,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 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 01:38:08,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 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 01:38:08,073 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 452 flow. Second operand 5 states and 131 transitions. [2023-11-29 01:38:08,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 970 flow [2023-11-29 01:38:08,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 99 transitions, 913 flow, removed 27 selfloop flow, removed 3 redundant places. [2023-11-29 01:38:08,088 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 473 flow [2023-11-29 01:38:08,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=473, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2023-11-29 01:38:08,089 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2023-11-29 01:38:08,090 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 473 flow [2023-11-29 01:38:08,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 01:38:08,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:08,090 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] [2023-11-29 01:38:08,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:38:08,091 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:08,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash -812898584, now seen corresponding path program 1 times [2023-11-29 01:38:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:08,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235924435] [2023-11-29 01:38:08,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:08,323 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 01:38:08,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:08,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235924435] [2023-11-29 01:38:08,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235924435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:08,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:08,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:38:08,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148143820] [2023-11-29 01:38:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:08,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:38:08,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:08,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:38:08,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:38:08,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2023-11-29 01:38:08,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 473 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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 01:38:08,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:08,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2023-11-29 01:38:08,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:08,751 INFO L124 PetriNetUnfolderBase]: 1310/2051 cut-off events. [2023-11-29 01:38:08,752 INFO L125 PetriNetUnfolderBase]: For 20611/20853 co-relation queries the response was YES. [2023-11-29 01:38:08,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10723 conditions, 2051 events. 1310/2051 cut-off events. For 20611/20853 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10354 event pairs, 204 based on Foata normal form. 202/2086 useless extension candidates. Maximal degree in co-relation 10685. Up to 819 conditions per place. [2023-11-29 01:38:08,761 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 64 selfloop transitions, 11 changer transitions 1/95 dead transitions. [2023-11-29 01:38:08,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 95 transitions, 864 flow [2023-11-29 01:38:08,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:38:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:38:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2023-11-29 01:38:08,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2023-11-29 01:38:08,762 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 143 transitions. [2023-11-29 01:38:08,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 143 transitions. [2023-11-29 01:38:08,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:08,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 143 transitions. [2023-11-29 01:38:08,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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 01:38:08,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 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 01:38:08,764 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 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 01:38:08,764 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 473 flow. Second operand 6 states and 143 transitions. [2023-11-29 01:38:08,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 95 transitions, 864 flow [2023-11-29 01:38:08,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 755 flow, removed 44 selfloop flow, removed 8 redundant places. [2023-11-29 01:38:08,776 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 412 flow [2023-11-29 01:38:08,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2023-11-29 01:38:08,777 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2023-11-29 01:38:08,777 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 412 flow [2023-11-29 01:38:08,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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 01:38:08,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:08,777 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] [2023-11-29 01:38:08,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:38:08,778 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:08,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash -323930240, now seen corresponding path program 1 times [2023-11-29 01:38:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:08,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134792832] [2023-11-29 01:38:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:08,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:09,629 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 01:38:09,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134792832] [2023-11-29 01:38:09,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134792832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:09,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:09,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:38:09,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391633964] [2023-11-29 01:38:09,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:09,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:38:09,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:09,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:38:09,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:38:09,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-29 01:38:09,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 412 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 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 01:38:09,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:09,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-29 01:38:09,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:10,021 INFO L124 PetriNetUnfolderBase]: 908/1793 cut-off events. [2023-11-29 01:38:10,021 INFO L125 PetriNetUnfolderBase]: For 8791/9083 co-relation queries the response was YES. [2023-11-29 01:38:10,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7136 conditions, 1793 events. 908/1793 cut-off events. For 8791/9083 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 11592 event pairs, 290 based on Foata normal form. 114/1724 useless extension candidates. Maximal degree in co-relation 7102. Up to 855 conditions per place. [2023-11-29 01:38:10,029 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 35 selfloop transitions, 8 changer transitions 10/81 dead transitions. [2023-11-29 01:38:10,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 81 transitions, 642 flow [2023-11-29 01:38:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:38:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:38:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2023-11-29 01:38:10,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2023-11-29 01:38:10,031 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 129 transitions. [2023-11-29 01:38:10,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 129 transitions. [2023-11-29 01:38:10,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:10,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 129 transitions. [2023-11-29 01:38:10,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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 01:38:10,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 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 01:38:10,033 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 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 01:38:10,033 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 412 flow. Second operand 6 states and 129 transitions. [2023-11-29 01:38:10,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 81 transitions, 642 flow [2023-11-29 01:38:10,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 532 flow, removed 42 selfloop flow, removed 10 redundant places. [2023-11-29 01:38:10,046 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 401 flow [2023-11-29 01:38:10,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=401, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2023-11-29 01:38:10,047 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-11-29 01:38:10,047 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 401 flow [2023-11-29 01:38:10,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 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 01:38:10,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:10,048 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] [2023-11-29 01:38:10,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:38:10,048 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:10,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash 561394468, now seen corresponding path program 2 times [2023-11-29 01:38:10,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:10,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594181083] [2023-11-29 01:38:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:10,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:11,294 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 01:38:11,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:38:11,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594181083] [2023-11-29 01:38:11,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594181083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:38:11,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:38:11,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:38:11,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846885608] [2023-11-29 01:38:11,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:38:11,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 01:38:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:11,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:38:11,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:38:11,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2023-11-29 01:38:11,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 401 flow. Second operand has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 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 01:38:11,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:11,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2023-11-29 01:38:11,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:38:11,926 INFO L124 PetriNetUnfolderBase]: 1535/2999 cut-off events. [2023-11-29 01:38:11,926 INFO L125 PetriNetUnfolderBase]: For 4606/4929 co-relation queries the response was YES. [2023-11-29 01:38:11,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9430 conditions, 2999 events. 1535/2999 cut-off events. For 4606/4929 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 21547 event pairs, 509 based on Foata normal form. 156/2873 useless extension candidates. Maximal degree in co-relation 9399. Up to 829 conditions per place. [2023-11-29 01:38:11,936 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 53 selfloop transitions, 14 changer transitions 25/119 dead transitions. [2023-11-29 01:38:11,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 119 transitions, 833 flow [2023-11-29 01:38:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:38:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 01:38:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2023-11-29 01:38:11,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6121794871794872 [2023-11-29 01:38:11,937 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 191 transitions. [2023-11-29 01:38:11,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 191 transitions. [2023-11-29 01:38:11,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:38:11,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 191 transitions. [2023-11-29 01:38:11,938 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 01:38:11,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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 01:38:11,939 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 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 01:38:11,939 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 401 flow. Second operand 8 states and 191 transitions. [2023-11-29 01:38:11,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 119 transitions, 833 flow [2023-11-29 01:38:11,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 119 transitions, 808 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 01:38:11,945 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 489 flow [2023-11-29 01:38:11,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=489, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2023-11-29 01:38:11,946 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2023-11-29 01:38:11,946 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 489 flow [2023-11-29 01:38:11,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 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 01:38:11,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:38:11,946 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] [2023-11-29 01:38:11,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:38:11,946 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 01:38:11,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:11,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1434255340, now seen corresponding path program 3 times [2023-11-29 01:38:11,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:38:11,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666119801] [2023-11-29 01:38:11,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:11,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:38:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:38:11,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:38:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:38:12,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:38:12,061 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:38:12,062 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-29 01:38:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-29 01:38:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-29 01:38:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-29 01:38:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-29 01:38:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-29 01:38:12,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:38:12,065 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:38:12,071 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 01:38:12,071 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:38:12,113 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 01:38:12,115 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 01:38:12,116 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 01:38:12,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:38:12 BasicIcfg [2023-11-29 01:38:12,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:38:12,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:38:12,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:38:12,140 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:38:12,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:37:57" (3/4) ... [2023-11-29 01:38:12,141 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 01:38:12,163 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 01:38:12,163 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 01:38:12,164 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 01:38:12,230 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:38:12,230 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:38:12,231 INFO L158 Benchmark]: Toolchain (without parser) took 15998.44ms. Allocated memory was 167.8MB in the beginning and 713.0MB in the end (delta: 545.3MB). Free memory was 132.4MB in the beginning and 544.0MB in the end (delta: -411.6MB). Peak memory consumption was 134.3MB. Max. memory is 16.1GB. [2023-11-29 01:38:12,231 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:38:12,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.27ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 108.6MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 01:38:12,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.43ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 105.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:38:12,233 INFO L158 Benchmark]: Boogie Preprocessor took 47.31ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 102.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:38:12,233 INFO L158 Benchmark]: RCFGBuilder took 668.28ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 102.3MB in the beginning and 162.5MB in the end (delta: -60.2MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2023-11-29 01:38:12,233 INFO L158 Benchmark]: TraceAbstraction took 14651.04ms. Allocated memory was 209.7MB in the beginning and 713.0MB in the end (delta: 503.3MB). Free memory was 161.5MB in the beginning and 556.6MB in the end (delta: -395.1MB). Peak memory consumption was 108.2MB. Max. memory is 16.1GB. [2023-11-29 01:38:12,234 INFO L158 Benchmark]: Witness Printer took 90.66ms. Allocated memory is still 713.0MB. Free memory was 556.6MB in the beginning and 544.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:38:12,236 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.18ms. Allocated memory is still 167.8MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.27ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 108.6MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.43ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 105.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.31ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 102.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 668.28ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 102.3MB in the beginning and 162.5MB in the end (delta: -60.2MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14651.04ms. Allocated memory was 209.7MB in the beginning and 713.0MB in the end (delta: 503.3MB). Free memory was 161.5MB in the beginning and 556.6MB in the end (delta: -395.1MB). Peak memory consumption was 108.2MB. Max. memory is 16.1GB. * Witness Printer took 90.66ms. Allocated memory is still 713.0MB. Free memory was 556.6MB in the beginning and 544.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, 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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 821]: 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: 823]: 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: 819]: 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, 64 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: 14.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 670 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 647 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1775 IncrementalHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 42 mSDtfsCounter, 1775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=4, InterpolantAutomatonStates: 94, 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.5s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 2166 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 01:38:12,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd98cf59-64ae-4ed2-a8be-73c291d2233f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE