./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 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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.3.0-?-4f9af40 [2024-11-07 11:14:20,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:14:20,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:14:20,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:14:20,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:14:20,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:14:20,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:14:20,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:14:20,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:14:20,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:14:20,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:14:20,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:14:20,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:14:20,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:14:20,257 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:14:20,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:14:20,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:14:20,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:14:20,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:14:20,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:14:20,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:14:20,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:14:20,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:14:20,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:14:20,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:14:20,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:14:20,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:14:20,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:14:20,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:14:20,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:14:20,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:14:20,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:14:20,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:14:20,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:14:20,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:14:20,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:14:20,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:14:20,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:14:20,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:14:20,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:14:20,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:14:20,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:14:20,262 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 [2024-11-07 11:14:20,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:14:20,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:14:20,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:14:20,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:14:20,569 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:14:20,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-07 11:14:21,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:14:22,292 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:14:22,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-07 11:14:22,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f66afd676/370e5587a10b4b10a86a556b0c8ab1fb/FLAG75b9e986b [2024-11-07 11:14:22,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f66afd676/370e5587a10b4b10a86a556b0c8ab1fb [2024-11-07 11:14:22,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:14:22,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:14:22,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:14:22,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:14:22,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:14:22,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7b1cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22, skipping insertion in model container [2024-11-07 11:14:22,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:14:22,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2024-11-07 11:14:22,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:14:22,716 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:14:22,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2024-11-07 11:14:22,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:14:22,835 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:14:22,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22 WrapperNode [2024-11-07 11:14:22,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:14:22,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:14:22,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:14:22,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:14:22,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,901 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-07 11:14:22,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:14:22,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:14:22,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:14:22,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:14:22,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,947 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 11:14:22,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:14:22,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:14:22,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:14:22,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:14:22,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (1/1) ... [2024-11-07 11:14:22,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:14:22,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:14:23,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 11:14:23,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 11:14:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 11:14:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:14:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 11:14:23,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 11:14:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 11:14:23,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 11:14:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 11:14:23,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 11:14:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:14:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 11:14:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:14:23,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:14:23,040 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 11:14:23,179 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:14:23,181 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:14:23,511 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:14:23,511 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:14:23,729 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:14:23,729 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 11:14:23,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:23 BoogieIcfgContainer [2024-11-07 11:14:23,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:14:23,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:14:23,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:14:23,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:14:23,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:14:22" (1/3) ... [2024-11-07 11:14:23,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f87162e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:14:23, skipping insertion in model container [2024-11-07 11:14:23,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:22" (2/3) ... [2024-11-07 11:14:23,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f87162e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:14:23, skipping insertion in model container [2024-11-07 11:14:23,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:23" (3/3) ... [2024-11-07 11:14:23,739 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-07 11:14:23,752 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:14:23,752 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 11:14:23,752 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:14:23,807 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:14:23,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-07 11:14:23,865 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-07 11:14:23,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:14:23,869 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 67 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. [2024-11-07 11:14:23,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-07 11:14:23,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-07 11:14:23,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:14:23,896 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b5266a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:14:23,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 11:14:23,900 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:14:23,901 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-07 11:14:23,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:14:23,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:23,901 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-07 11:14:23,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:23,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash 10922588, now seen corresponding path program 1 times [2024-11-07 11:14:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:23,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404895091] [2024-11-07 11:14:23,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:24,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404895091] [2024-11-07 11:14:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404895091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:24,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:24,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 11:14:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615784097] [2024-11-07 11:14:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:24,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:14:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:24,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:14:24,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:14:24,414 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-11-07 11:14:24,416 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) [2024-11-07 11:14:24,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:24,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-11-07 11:14:24,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:24,772 INFO L124 PetriNetUnfolderBase]: 530/980 cut-off events. [2024-11-07 11:14:24,772 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-07 11:14:24,777 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 76. Compared 5509 event pairs, 284 based on Foata normal form. 36/994 useless extension candidates. Maximal degree in co-relation 1823. Up to 664 conditions per place. [2024-11-07 11:14:24,787 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-07 11:14:24,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2024-11-07 11:14:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:14:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 11:14:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-07 11:14:24,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2024-11-07 11:14:24,801 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 90 transitions. [2024-11-07 11:14:24,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2024-11-07 11:14:24,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 11:14:24,809 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-07 11:14:24,812 INFO L260 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} [2024-11-07 11:14:24,815 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-07 11:14:24,816 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-07 11:14:24,822 INFO L472 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) [2024-11-07 11:14:24,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:24,823 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:24,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:14:24,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:24,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:24,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1679189843, now seen corresponding path program 1 times [2024-11-07 11:14:24,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:24,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58833125] [2024-11-07 11:14:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:24,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:25,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:25,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58833125] [2024-11-07 11:14:25,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58833125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:25,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:25,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:14:25,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875347436] [2024-11-07 11:14:25,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:26,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:14:26,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:26,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:14:26,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:14:26,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-11-07 11:14:26,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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) [2024-11-07 11:14:26,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:26,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-11-07 11:14:26,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:27,094 INFO L124 PetriNetUnfolderBase]: 2216/3644 cut-off events. [2024-11-07 11:14:27,094 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-07 11:14:27,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7151 conditions, 3644 events. 2216/3644 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 23354 event pairs, 299 based on Foata normal form. 0/3553 useless extension candidates. Maximal degree in co-relation 7141. Up to 1815 conditions per place. [2024-11-07 11:14:27,109 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 41 selfloop transitions, 10 changer transitions 72/133 dead transitions. [2024-11-07 11:14:27,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 133 transitions, 542 flow [2024-11-07 11:14:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 11:14:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 11:14:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 282 transitions. [2024-11-07 11:14:27,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2024-11-07 11:14:27,111 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 12 states and 282 transitions. [2024-11-07 11:14:27,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 133 transitions, 542 flow [2024-11-07 11:14:27,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 133 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:14:27,113 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 169 flow [2024-11-07 11:14:27,113 INFO L260 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=169, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2024-11-07 11:14:27,114 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2024-11-07 11:14:27,114 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 169 flow [2024-11-07 11:14:27,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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) [2024-11-07 11:14:27,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:27,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:27,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:14:27,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:27,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash -417730636, now seen corresponding path program 1 times [2024-11-07 11:14:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:27,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358280596] [2024-11-07 11:14:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:27,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:27,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358280596] [2024-11-07 11:14:27,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358280596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:27,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:27,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:14:27,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091062260] [2024-11-07 11:14:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:27,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:14:27,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:27,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:14:27,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:14:27,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-07 11:14:27,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:27,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:27,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-07 11:14:27,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:27,964 INFO L124 PetriNetUnfolderBase]: 1342/2357 cut-off events. [2024-11-07 11:14:27,964 INFO L125 PetriNetUnfolderBase]: For 5932/6032 co-relation queries the response was YES. [2024-11-07 11:14:27,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8251 conditions, 2357 events. 1342/2357 cut-off events. For 5932/6032 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15229 event pairs, 220 based on Foata normal form. 127/2425 useless extension candidates. Maximal degree in co-relation 8232. Up to 1268 conditions per place. [2024-11-07 11:14:27,986 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 41 selfloop transitions, 8 changer transitions 28/92 dead transitions. [2024-11-07 11:14:27,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 92 transitions, 602 flow [2024-11-07 11:14:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:14:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 11:14:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-11-07 11:14:27,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6007326007326007 [2024-11-07 11:14:27,989 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 169 flow. Second operand 7 states and 164 transitions. [2024-11-07 11:14:27,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 92 transitions, 602 flow [2024-11-07 11:14:28,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 550 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-11-07 11:14:28,017 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 215 flow [2024-11-07 11:14:28,017 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=215, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-11-07 11:14:28,018 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-11-07 11:14:28,019 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 215 flow [2024-11-07 11:14:28,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:28,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:28,019 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:28,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:14:28,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:28,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash -609637483, now seen corresponding path program 1 times [2024-11-07 11:14:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:28,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2812509] [2024-11-07 11:14:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:28,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2812509] [2024-11-07 11:14:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2812509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:28,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:28,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:14:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176092021] [2024-11-07 11:14:28,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:28,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:14:28,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:28,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:14:28,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:14:28,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-07 11:14:28,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 215 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) [2024-11-07 11:14:28,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:28,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-07 11:14:28,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:29,900 INFO L124 PetriNetUnfolderBase]: 2594/4236 cut-off events. [2024-11-07 11:14:29,900 INFO L125 PetriNetUnfolderBase]: For 6860/6862 co-relation queries the response was YES. [2024-11-07 11:14:29,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13741 conditions, 4236 events. 2594/4236 cut-off events. For 6860/6862 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 27174 event pairs, 271 based on Foata normal form. 93/4317 useless extension candidates. Maximal degree in co-relation 13722. Up to 1887 conditions per place. [2024-11-07 11:14:29,933 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 58 selfloop transitions, 27 changer transitions 94/188 dead transitions. [2024-11-07 11:14:29,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 188 transitions, 1267 flow [2024-11-07 11:14:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 11:14:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 11:14:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 302 transitions. [2024-11-07 11:14:29,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5956607495069034 [2024-11-07 11:14:29,936 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 215 flow. Second operand 13 states and 302 transitions. [2024-11-07 11:14:29,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 188 transitions, 1267 flow [2024-11-07 11:14:29,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 188 transitions, 1267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 11:14:29,944 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 483 flow [2024-11-07 11:14:29,945 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=483, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2024-11-07 11:14:29,945 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2024-11-07 11:14:29,945 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 483 flow [2024-11-07 11:14:29,946 INFO L472 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) [2024-11-07 11:14:29,946 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:29,946 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:29,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:14:29,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:29,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1622333237, now seen corresponding path program 2 times [2024-11-07 11:14:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154188882] [2024-11-07 11:14:29,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154188882] [2024-11-07 11:14:30,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154188882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:30,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:30,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:14:30,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194004784] [2024-11-07 11:14:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:30,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:14:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:30,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:14:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:14:30,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-07 11:14:30,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 483 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:30,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:30,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-07 11:14:30,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:31,407 INFO L124 PetriNetUnfolderBase]: 2363/3851 cut-off events. [2024-11-07 11:14:31,408 INFO L125 PetriNetUnfolderBase]: For 28308/28312 co-relation queries the response was YES. [2024-11-07 11:14:31,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19711 conditions, 3851 events. 2363/3851 cut-off events. For 28308/28312 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23919 event pairs, 353 based on Foata normal form. 82/3916 useless extension candidates. Maximal degree in co-relation 19678. Up to 1446 conditions per place. [2024-11-07 11:14:31,448 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 54 selfloop transitions, 10 changer transitions 68/141 dead transitions. [2024-11-07 11:14:31,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 141 transitions, 1508 flow [2024-11-07 11:14:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:14:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 11:14:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2024-11-07 11:14:31,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5754985754985755 [2024-11-07 11:14:31,450 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 483 flow. Second operand 9 states and 202 transitions. [2024-11-07 11:14:31,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 141 transitions, 1508 flow [2024-11-07 11:14:31,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 141 transitions, 1448 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-11-07 11:14:31,483 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 418 flow [2024-11-07 11:14:31,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=418, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2024-11-07 11:14:31,484 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2024-11-07 11:14:31,484 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 418 flow [2024-11-07 11:14:31,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:31,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:31,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:31,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:14:31,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:31,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:31,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1830961084, now seen corresponding path program 1 times [2024-11-07 11:14:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640348451] [2024-11-07 11:14:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:31,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:31,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:31,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640348451] [2024-11-07 11:14:31,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640348451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:31,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:31,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:14:31,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793202444] [2024-11-07 11:14:31,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:31,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:14:31,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:31,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:14:31,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:14:31,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-07 11:14:31,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 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) [2024-11-07 11:14:31,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:31,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-07 11:14:31,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:32,475 INFO L124 PetriNetUnfolderBase]: 1322/2249 cut-off events. [2024-11-07 11:14:32,476 INFO L125 PetriNetUnfolderBase]: For 19913/20075 co-relation queries the response was YES. [2024-11-07 11:14:32,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12064 conditions, 2249 events. 1322/2249 cut-off events. For 19913/20075 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13014 event pairs, 553 based on Foata normal form. 216/2437 useless extension candidates. Maximal degree in co-relation 12038. Up to 1514 conditions per place. [2024-11-07 11:14:32,506 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 38 selfloop transitions, 4 changer transitions 33/95 dead transitions. [2024-11-07 11:14:32,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 95 transitions, 958 flow [2024-11-07 11:14:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:14:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 11:14:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-11-07 11:14:32,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6043956043956044 [2024-11-07 11:14:32,508 INFO L175 Difference]: Start difference. First operand has 77 places, 51 transitions, 418 flow. Second operand 7 states and 165 transitions. [2024-11-07 11:14:32,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 95 transitions, 958 flow [2024-11-07 11:14:32,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 95 transitions, 887 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-11-07 11:14:32,527 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 417 flow [2024-11-07 11:14:32,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=417, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2024-11-07 11:14:32,527 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2024-11-07 11:14:32,527 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 417 flow [2024-11-07 11:14:32,528 INFO L472 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) [2024-11-07 11:14:32,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:32,528 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:32,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:14:32,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:32,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash 804089851, now seen corresponding path program 1 times [2024-11-07 11:14:32,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:32,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86658562] [2024-11-07 11:14:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:32,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:33,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86658562] [2024-11-07 11:14:33,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86658562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:33,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:33,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:14:33,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744127541] [2024-11-07 11:14:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:33,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:14:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:14:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:14:33,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-07 11:14:33,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:33,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:33,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-07 11:14:33,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:34,020 INFO L124 PetriNetUnfolderBase]: 1444/2376 cut-off events. [2024-11-07 11:14:34,021 INFO L125 PetriNetUnfolderBase]: For 17771/17771 co-relation queries the response was YES. [2024-11-07 11:14:34,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12752 conditions, 2376 events. 1444/2376 cut-off events. For 17771/17771 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13056 event pairs, 527 based on Foata normal form. 53/2427 useless extension candidates. Maximal degree in co-relation 12728. Up to 1462 conditions per place. [2024-11-07 11:14:34,046 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 52 selfloop transitions, 23 changer transitions 38/123 dead transitions. [2024-11-07 11:14:34,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 123 transitions, 1214 flow [2024-11-07 11:14:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 11:14:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 11:14:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 235 transitions. [2024-11-07 11:14:34,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5477855477855478 [2024-11-07 11:14:34,049 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 417 flow. Second operand 11 states and 235 transitions. [2024-11-07 11:14:34,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 123 transitions, 1214 flow [2024-11-07 11:14:34,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 123 transitions, 1181 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-11-07 11:14:34,072 INFO L231 Difference]: Finished difference. Result has 84 places, 55 transitions, 490 flow [2024-11-07 11:14:34,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=490, PETRI_PLACES=84, PETRI_TRANSITIONS=55} [2024-11-07 11:14:34,073 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2024-11-07 11:14:34,073 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 55 transitions, 490 flow [2024-11-07 11:14:34,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:34,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:34,073 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:14:34,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:34,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash -258843994, now seen corresponding path program 1 times [2024-11-07 11:14:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:34,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108856663] [2024-11-07 11:14:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:35,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:35,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108856663] [2024-11-07 11:14:35,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108856663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:35,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:35,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:14:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161072139] [2024-11-07 11:14:35,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:35,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:14:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:14:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:14:35,167 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-07 11:14:35,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 55 transitions, 490 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:35,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:35,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-07 11:14:35,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:35,935 INFO L124 PetriNetUnfolderBase]: 1496/2468 cut-off events. [2024-11-07 11:14:35,935 INFO L125 PetriNetUnfolderBase]: For 21505/21505 co-relation queries the response was YES. [2024-11-07 11:14:35,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14014 conditions, 2468 events. 1496/2468 cut-off events. For 21505/21505 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13711 event pairs, 416 based on Foata normal form. 60/2523 useless extension candidates. Maximal degree in co-relation 13985. Up to 1546 conditions per place. [2024-11-07 11:14:35,961 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 66 selfloop transitions, 34 changer transitions 53/163 dead transitions. [2024-11-07 11:14:35,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 163 transitions, 1913 flow [2024-11-07 11:14:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 11:14:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 11:14:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 260 transitions. [2024-11-07 11:14:35,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-07 11:14:35,963 INFO L175 Difference]: Start difference. First operand has 84 places, 55 transitions, 490 flow. Second operand 12 states and 260 transitions. [2024-11-07 11:14:35,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 163 transitions, 1913 flow [2024-11-07 11:14:35,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 163 transitions, 1773 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-11-07 11:14:35,993 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 911 flow [2024-11-07 11:14:35,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=911, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2024-11-07 11:14:35,995 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2024-11-07 11:14:35,996 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 911 flow [2024-11-07 11:14:35,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:35,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:35,997 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:35,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:14:35,997 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:35,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:35,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1824752836, now seen corresponding path program 2 times [2024-11-07 11:14:35,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:35,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924988234] [2024-11-07 11:14:35,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:35,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:36,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924988234] [2024-11-07 11:14:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924988234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:14:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12216142] [2024-11-07 11:14:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:14:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:14:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:14:36,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-07 11:14:36,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 911 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) [2024-11-07 11:14:36,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:36,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-07 11:14:36,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:36,676 INFO L124 PetriNetUnfolderBase]: 2129/3334 cut-off events. [2024-11-07 11:14:36,677 INFO L125 PetriNetUnfolderBase]: For 55648/56714 co-relation queries the response was YES. [2024-11-07 11:14:36,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20181 conditions, 3334 events. 2129/3334 cut-off events. For 55648/56714 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18218 event pairs, 323 based on Foata normal form. 607/3763 useless extension candidates. Maximal degree in co-relation 20149. Up to 1615 conditions per place. [2024-11-07 11:14:36,712 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 70 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2024-11-07 11:14:36,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 99 transitions, 1260 flow [2024-11-07 11:14:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:14:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:14:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-07 11:14:36,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2024-11-07 11:14:36,714 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 911 flow. Second operand 4 states and 103 transitions. [2024-11-07 11:14:36,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 99 transitions, 1260 flow [2024-11-07 11:14:36,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 99 transitions, 1180 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-11-07 11:14:36,750 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 726 flow [2024-11-07 11:14:36,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=726, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2024-11-07 11:14:36,751 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2024-11-07 11:14:36,751 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 726 flow [2024-11-07 11:14:36,751 INFO L472 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) [2024-11-07 11:14:36,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:36,752 INFO L204 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] [2024-11-07 11:14:36,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 11:14:36,752 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:36,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1023790037, now seen corresponding path program 1 times [2024-11-07 11:14:36,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:36,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388997152] [2024-11-07 11:14:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:37,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:37,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388997152] [2024-11-07 11:14:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388997152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:37,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:37,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:14:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714800351] [2024-11-07 11:14:37,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:37,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:14:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:37,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:14:37,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:14:37,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-07 11:14:37,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 726 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:37,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:37,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-07 11:14:37,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:38,072 INFO L124 PetriNetUnfolderBase]: 1369/2412 cut-off events. [2024-11-07 11:14:38,072 INFO L125 PetriNetUnfolderBase]: For 23480/23845 co-relation queries the response was YES. [2024-11-07 11:14:38,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13239 conditions, 2412 events. 1369/2412 cut-off events. For 23480/23845 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14544 event pairs, 645 based on Foata normal form. 286/2577 useless extension candidates. Maximal degree in co-relation 13208. Up to 1652 conditions per place. [2024-11-07 11:14:38,102 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 48 selfloop transitions, 15 changer transitions 27/117 dead transitions. [2024-11-07 11:14:38,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 117 transitions, 1360 flow [2024-11-07 11:14:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:14:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:14:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-11-07 11:14:38,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.592948717948718 [2024-11-07 11:14:38,105 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 726 flow. Second operand 8 states and 185 transitions. [2024-11-07 11:14:38,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 117 transitions, 1360 flow [2024-11-07 11:14:38,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 117 transitions, 1294 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-11-07 11:14:38,128 INFO L231 Difference]: Finished difference. Result has 92 places, 73 transitions, 806 flow [2024-11-07 11:14:38,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=806, PETRI_PLACES=92, PETRI_TRANSITIONS=73} [2024-11-07 11:14:38,130 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2024-11-07 11:14:38,130 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 73 transitions, 806 flow [2024-11-07 11:14:38,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:38,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:38,130 INFO L204 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] [2024-11-07 11:14:38,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 11:14:38,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:38,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1011134156, now seen corresponding path program 1 times [2024-11-07 11:14:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:38,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534859538] [2024-11-07 11:14:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:38,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:38,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:38,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534859538] [2024-11-07 11:14:38,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534859538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:38,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:38,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:14:38,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392006716] [2024-11-07 11:14:38,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:38,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:14:38,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:38,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:14:38,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:14:38,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-07 11:14:38,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 73 transitions, 806 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) [2024-11-07 11:14:38,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:38,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-07 11:14:38,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:38,765 INFO L124 PetriNetUnfolderBase]: 1628/2568 cut-off events. [2024-11-07 11:14:38,765 INFO L125 PetriNetUnfolderBase]: For 35616/36343 co-relation queries the response was YES. [2024-11-07 11:14:38,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14956 conditions, 2568 events. 1628/2568 cut-off events. For 35616/36343 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13283 event pairs, 213 based on Foata normal form. 323/2722 useless extension candidates. Maximal degree in co-relation 14924. Up to 997 conditions per place. [2024-11-07 11:14:38,785 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 81 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2024-11-07 11:14:38,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 114 transitions, 1416 flow [2024-11-07 11:14:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:14:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:14:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-11-07 11:14:38,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2024-11-07 11:14:38,786 INFO L175 Difference]: Start difference. First operand has 92 places, 73 transitions, 806 flow. Second operand 5 states and 131 transitions. [2024-11-07 11:14:38,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 114 transitions, 1416 flow [2024-11-07 11:14:38,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 114 transitions, 1362 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-11-07 11:14:38,810 INFO L231 Difference]: Finished difference. Result has 90 places, 76 transitions, 804 flow [2024-11-07 11:14:38,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=804, PETRI_PLACES=90, PETRI_TRANSITIONS=76} [2024-11-07 11:14:38,811 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places. [2024-11-07 11:14:38,811 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 76 transitions, 804 flow [2024-11-07 11:14:38,812 INFO L472 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) [2024-11-07 11:14:38,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:38,812 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:38,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 11:14:38,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:38,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1423838541, now seen corresponding path program 1 times [2024-11-07 11:14:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986823762] [2024-11-07 11:14:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:39,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:39,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986823762] [2024-11-07 11:14:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986823762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:39,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:39,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:14:39,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750000571] [2024-11-07 11:14:39,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:39,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:14:39,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:14:39,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:14:39,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-07 11:14:39,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 76 transitions, 804 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) [2024-11-07 11:14:39,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:39,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-07 11:14:39,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:39,366 INFO L124 PetriNetUnfolderBase]: 1324/2056 cut-off events. [2024-11-07 11:14:39,366 INFO L125 PetriNetUnfolderBase]: For 30392/31079 co-relation queries the response was YES. [2024-11-07 11:14:39,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12383 conditions, 2056 events. 1324/2056 cut-off events. For 30392/31079 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10308 event pairs, 197 based on Foata normal form. 233/2124 useless extension candidates. Maximal degree in co-relation 12351. Up to 813 conditions per place. [2024-11-07 11:14:39,379 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 73 selfloop transitions, 11 changer transitions 1/110 dead transitions. [2024-11-07 11:14:39,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 110 transitions, 1285 flow [2024-11-07 11:14:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:14:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:14:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-11-07 11:14:39,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-11-07 11:14:39,381 INFO L175 Difference]: Start difference. First operand has 90 places, 76 transitions, 804 flow. Second operand 6 states and 143 transitions. [2024-11-07 11:14:39,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 110 transitions, 1285 flow [2024-11-07 11:14:39,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 110 transitions, 1172 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-11-07 11:14:39,400 INFO L231 Difference]: Finished difference. Result has 90 places, 75 transitions, 728 flow [2024-11-07 11:14:39,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=728, PETRI_PLACES=90, PETRI_TRANSITIONS=75} [2024-11-07 11:14:39,401 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places. [2024-11-07 11:14:39,401 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 75 transitions, 728 flow [2024-11-07 11:14:39,401 INFO L472 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) [2024-11-07 11:14:39,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:39,401 INFO L204 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] [2024-11-07 11:14:39,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 11:14:39,401 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:39,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:39,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1932628143, now seen corresponding path program 1 times [2024-11-07 11:14:39,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:39,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416706718] [2024-11-07 11:14:39,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:40,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:40,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416706718] [2024-11-07 11:14:40,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416706718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:40,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:40,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:14:40,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119648883] [2024-11-07 11:14:40,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:40,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:14:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:40,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:14:40,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:14:40,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-07 11:14:40,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 75 transitions, 728 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) [2024-11-07 11:14:40,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:40,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-07 11:14:40,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:40,920 INFO L124 PetriNetUnfolderBase]: 854/1697 cut-off events. [2024-11-07 11:14:40,921 INFO L125 PetriNetUnfolderBase]: For 11918/12239 co-relation queries the response was YES. [2024-11-07 11:14:40,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7944 conditions, 1697 events. 854/1697 cut-off events. For 11918/12239 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10580 event pairs, 189 based on Foata normal form. 127/1694 useless extension candidates. Maximal degree in co-relation 7915. Up to 793 conditions per place. [2024-11-07 11:14:40,935 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 46 selfloop transitions, 21 changer transitions 13/111 dead transitions. [2024-11-07 11:14:40,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 111 transitions, 1160 flow [2024-11-07 11:14:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:14:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:14:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2024-11-07 11:14:40,937 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5544871794871795 [2024-11-07 11:14:40,937 INFO L175 Difference]: Start difference. First operand has 90 places, 75 transitions, 728 flow. Second operand 8 states and 173 transitions. [2024-11-07 11:14:40,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 111 transitions, 1160 flow [2024-11-07 11:14:40,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 111 transitions, 1010 flow, removed 62 selfloop flow, removed 10 redundant places. [2024-11-07 11:14:40,958 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 807 flow [2024-11-07 11:14:40,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=807, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2024-11-07 11:14:40,959 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2024-11-07 11:14:40,959 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 807 flow [2024-11-07 11:14:40,959 INFO L472 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) [2024-11-07 11:14:40,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:40,960 INFO L204 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] [2024-11-07 11:14:40,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 11:14:40,960 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:40,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:40,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1683085337, now seen corresponding path program 2 times [2024-11-07 11:14:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:40,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017492364] [2024-11-07 11:14:40,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:40,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:14:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017492364] [2024-11-07 11:14:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017492364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:42,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:42,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 11:14:42,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059184648] [2024-11-07 11:14:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:42,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 11:14:42,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:42,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 11:14:42,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:14:42,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-07 11:14:42,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 807 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) [2024-11-07 11:14:42,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:42,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-07 11:14:42,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:43,034 INFO L124 PetriNetUnfolderBase]: 1184/2379 cut-off events. [2024-11-07 11:14:43,034 INFO L125 PetriNetUnfolderBase]: For 8523/8810 co-relation queries the response was YES. [2024-11-07 11:14:43,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9112 conditions, 2379 events. 1184/2379 cut-off events. For 8523/8810 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 16259 event pairs, 282 based on Foata normal form. 88/2275 useless extension candidates. Maximal degree in co-relation 9085. Up to 508 conditions per place. [2024-11-07 11:14:43,049 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 57 selfloop transitions, 19 changer transitions 31/137 dead transitions. [2024-11-07 11:14:43,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 137 transitions, 1310 flow [2024-11-07 11:14:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 11:14:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 11:14:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-11-07 11:14:43,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5794871794871795 [2024-11-07 11:14:43,051 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 807 flow. Second operand 10 states and 226 transitions. [2024-11-07 11:14:43,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 137 transitions, 1310 flow [2024-11-07 11:14:43,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 137 transitions, 1275 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-11-07 11:14:43,067 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 829 flow [2024-11-07 11:14:43,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=829, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2024-11-07 11:14:43,068 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2024-11-07 11:14:43,069 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 829 flow [2024-11-07 11:14:43,069 INFO L472 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) [2024-11-07 11:14:43,069 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:43,069 INFO L204 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] [2024-11-07 11:14:43,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 11:14:43,069 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash 430773529, now seen corresponding path program 3 times [2024-11-07 11:14:43,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:43,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237308258] [2024-11-07 11:14:43,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:43,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:14:43,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:14:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:14:43,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:14:43,238 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:14:43,239 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-07 11:14:43,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-07 11:14:43,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-07 11:14:43,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-07 11:14:43,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-07 11:14:43,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-07 11:14:43,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 11:14:43,242 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:43,330 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:14:43,330 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:14:43,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:14:43 BasicIcfg [2024-11-07 11:14:43,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:14:43,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:14:43,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:14:43,338 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:14:43,339 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:23" (3/4) ... [2024-11-07 11:14:43,340 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 11:14:43,427 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:14:43,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:14:43,428 INFO L158 Benchmark]: Toolchain (without parser) took 21090.36ms. Allocated memory was 109.1MB in the beginning and 620.8MB in the end (delta: 511.7MB). Free memory was 83.9MB in the beginning and 482.2MB in the end (delta: -398.3MB). Peak memory consumption was 114.0MB. Max. memory is 16.1GB. [2024-11-07 11:14:43,429 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:14:43,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.72ms. Allocated memory is still 109.1MB. Free memory was 83.7MB in the beginning and 60.5MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 11:14:43,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.65ms. Allocated memory is still 109.1MB. Free memory was 60.5MB in the beginning and 58.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:14:43,430 INFO L158 Benchmark]: Boogie Preprocessor took 70.18ms. Allocated memory is still 109.1MB. Free memory was 58.0MB in the beginning and 55.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:14:43,430 INFO L158 Benchmark]: RCFGBuilder took 753.07ms. Allocated memory is still 109.1MB. Free memory was 55.1MB in the beginning and 49.2MB in the end (delta: 5.8MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-07 11:14:43,431 INFO L158 Benchmark]: TraceAbstraction took 19604.34ms. Allocated memory was 109.1MB in the beginning and 620.8MB in the end (delta: 511.7MB). Free memory was 48.7MB in the beginning and 494.8MB in the end (delta: -446.1MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2024-11-07 11:14:43,431 INFO L158 Benchmark]: Witness Printer took 90.60ms. Allocated memory is still 620.8MB. Free memory was 494.8MB in the beginning and 482.2MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 11:14:43,432 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.28ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.72ms. Allocated memory is still 109.1MB. Free memory was 83.7MB in the beginning and 60.5MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.65ms. Allocated memory is still 109.1MB. Free memory was 60.5MB in the beginning and 58.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.18ms. Allocated memory is still 109.1MB. Free memory was 58.0MB in the beginning and 55.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 753.07ms. Allocated memory is still 109.1MB. Free memory was 55.1MB in the beginning and 49.2MB in the end (delta: 5.8MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19604.34ms. Allocated memory was 109.1MB in the beginning and 620.8MB in the end (delta: 511.7MB). Free memory was 48.7MB in the beginning and 494.8MB in the end (delta: -446.1MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * Witness Printer took 90.60ms. Allocated memory is still 620.8MB. Free memory was 494.8MB in the beginning and 482.2MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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=-3, 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 [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-3, t2026=-2, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-3, t2026=-2, t2027=-1, 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-3, t2026=-2, t2027=-1, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-3, t2026=-2, t2027=-1, 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-3, t2026=-2, t2027=-1, weak$$choice0=1, 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(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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: 19.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 815 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 399 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2222 IncrementalHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 93 mSDtfsCounter, 2222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=911occurred in iteration=8, InterpolantAutomatonStates: 115, 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.5s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 2709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-07 11:14:43,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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