./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_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/safe008_power.oepc_pso.oepc_pso.opt_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', 'e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281'] 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/safe008_power.oepc_pso.oepc_pso.opt_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 e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:14:13,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:14:13,826 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:13,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:14:13,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:14:13,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:14:13,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:14:13,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:14:13,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:14:13,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:14:13,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:14:13,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:14:13,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:14:13,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:14:13,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:14:13,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:14:13,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:14:13,847 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:14:13,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:14:13,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:14:13,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:14:13,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:14:13,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:14:13,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:14:13,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:14:13,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:14:13,849 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 -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 [2024-11-07 11:14:14,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:14:14,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:14:14,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:14:14,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:14:14,036 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:14:14,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 11:14:15,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:14:15,487 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:14:15,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 11:14:15,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b76a28e46/52a6430a349a457bb8a1b72d90f82eda/FLAG4b970c68a [2024-11-07 11:14:15,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b76a28e46/52a6430a349a457bb8a1b72d90f82eda [2024-11-07 11:14:15,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:14:15,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:14:15,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:14:15,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:14:15,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:14:15,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:14:15" (1/1) ... [2024-11-07 11:14:15,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b7b480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:15, skipping insertion in model container [2024-11-07 11:14:15,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:14:15" (1/1) ... [2024-11-07 11:14:15,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:14:15,645 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2024-11-07 11:14:15,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:14:15,762 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:14:15,773 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2024-11-07 11:14:15,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:14:15,860 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:14:15,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:15 WrapperNode [2024-11-07 11:14:15,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:14:15,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:14:15,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:14:15,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:14:15,868 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:15" (1/1) ... [2024-11-07 11:14:15,882 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:15" (1/1) ... [2024-11-07 11:14:15,911 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2024-11-07 11:14:15,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:14:15,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:14:15,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:14:15,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:14:15,924 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:15" (1/1) ... [2024-11-07 11:14:15,924 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:15" (1/1) ... [2024-11-07 11:14:15,926 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:15" (1/1) ... [2024-11-07 11:14:15,945 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:15,945 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:15" (1/1) ... [2024-11-07 11:14:15,945 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:15" (1/1) ... [2024-11-07 11:14:15,954 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:15" (1/1) ... [2024-11-07 11:14:15,959 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:15" (1/1) ... [2024-11-07 11:14:15,961 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:15" (1/1) ... [2024-11-07 11:14:15,961 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:15" (1/1) ... [2024-11-07 11:14:15,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:14:15,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:14:15,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:14:15,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:14:15,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:15" (1/1) ... [2024-11-07 11:14:15,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:14:15,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:14:15,997 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:16,000 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:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 11:14:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:14:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 11:14:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 11:14:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 11:14:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 11:14:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 11:14:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 11:14:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:14:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 11:14:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:14:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:14:16,020 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:16,119 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:14:16,120 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:14:16,389 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:14:16,389 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:14:16,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:14:16,536 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 11:14:16,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:16 BoogieIcfgContainer [2024-11-07 11:14:16,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:14:16,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:14:16,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:14:16,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:14:16,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:14:15" (1/3) ... [2024-11-07 11:14:16,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4c37d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:14:16, skipping insertion in model container [2024-11-07 11:14:16,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:15" (2/3) ... [2024-11-07 11:14:16,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4c37d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:14:16, skipping insertion in model container [2024-11-07 11:14:16,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:16" (3/3) ... [2024-11-07 11:14:16,548 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 11:14:16,561 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:14:16,561 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 11:14:16,561 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:14:16,607 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:14:16,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-07 11:14:16,668 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-07 11:14:16,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:14:16,672 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 65 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:16,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-07 11:14:16,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-07 11:14:16,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:14:16,692 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;@1f5eba2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:14:16,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 11:14:16,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:14:16,696 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-07 11:14:16,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:14:16,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:16,696 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-07 11:14:16,697 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:16,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:16,700 INFO L85 PathProgramCache]: Analyzing trace with hash 10980312, now seen corresponding path program 1 times [2024-11-07 11:14:16,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678502207] [2024-11-07 11:14:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:16,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:17,085 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:17,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:17,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678502207] [2024-11-07 11:14:17,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678502207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:17,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:17,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 11:14:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486154172] [2024-11-07 11:14:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:17,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:14:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:17,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:14:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:14:17,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-11-07 11:14:17,120 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:17,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:17,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-11-07 11:14:17,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:17,402 INFO L124 PetriNetUnfolderBase]: 530/980 cut-off events. [2024-11-07 11:14:17,402 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-07 11:14:17,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 980 events. 530/980 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5560 event pairs, 284 based on Foata normal form. 36/991 useless extension candidates. Maximal degree in co-relation 1823. Up to 664 conditions per place. [2024-11-07 11:14:17,412 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-07 11:14:17,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2024-11-07 11:14:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:14:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 11:14:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-07 11:14:17,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2024-11-07 11:14:17,423 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:17,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2024-11-07 11:14:17,426 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:17,428 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-07 11:14:17,430 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:17,434 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-07 11:14:17,434 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-07 11:14:17,434 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:17,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:17,434 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:17,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:14:17,435 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:17,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:17,436 INFO L85 PathProgramCache]: Analyzing trace with hash 787594160, now seen corresponding path program 1 times [2024-11-07 11:14:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:17,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170487844] [2024-11-07 11:14:17,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:17,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:17,704 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:17,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:17,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170487844] [2024-11-07 11:14:17,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170487844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:17,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:17,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:14:17,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209165800] [2024-11-07 11:14:17,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:17,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:14:17,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:17,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:14:17,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:14:17,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-07 11:14:17,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:17,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:17,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-07 11:14:17,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:18,010 INFO L124 PetriNetUnfolderBase]: 1215/2079 cut-off events. [2024-11-07 11:14:18,012 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-11-07 11:14:18,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4099 conditions, 2079 events. 1215/2079 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12553 event pairs, 149 based on Foata normal form. 80/2040 useless extension candidates. Maximal degree in co-relation 4089. Up to 1081 conditions per place. [2024-11-07 11:14:18,025 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 39 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2024-11-07 11:14:18,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 220 flow [2024-11-07 11:14:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:14:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:14:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-07 11:14:18,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2024-11-07 11:14:18,027 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 103 transitions. [2024-11-07 11:14:18,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 220 flow [2024-11-07 11:14:18,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:14:18,030 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2024-11-07 11:14:18,031 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-11-07 11:14:18,031 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-11-07 11:14:18,032 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2024-11-07 11:14:18,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:18,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:18,032 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:18,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:14:18,032 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:18,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash 958231978, now seen corresponding path program 1 times [2024-11-07 11:14:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371379196] [2024-11-07 11:14:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:18,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:18,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:18,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371379196] [2024-11-07 11:14:18,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371379196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:18,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:18,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:14:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459627888] [2024-11-07 11:14:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:18,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:14:18,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:18,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:14:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:14:18,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-07 11:14:18,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 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:18,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:18,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-07 11:14:18,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:18,542 INFO L124 PetriNetUnfolderBase]: 811/1407 cut-off events. [2024-11-07 11:14:18,542 INFO L125 PetriNetUnfolderBase]: For 362/362 co-relation queries the response was YES. [2024-11-07 11:14:18,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3219 conditions, 1407 events. 811/1407 cut-off events. For 362/362 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7563 event pairs, 75 based on Foata normal form. 68/1396 useless extension candidates. Maximal degree in co-relation 3207. Up to 521 conditions per place. [2024-11-07 11:14:18,550 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 49 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2024-11-07 11:14:18,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 309 flow [2024-11-07 11:14:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:14:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:14:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-11-07 11:14:18,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-07 11:14:18,555 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 130 transitions. [2024-11-07 11:14:18,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 309 flow [2024-11-07 11:14:18,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 299 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 11:14:18,558 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2024-11-07 11:14:18,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-07 11:14:18,559 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-11-07 11:14:18,559 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2024-11-07 11:14:18,559 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:18,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:18,559 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:18,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:14:18,560 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:18,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash -484325393, now seen corresponding path program 1 times [2024-11-07 11:14:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:18,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715890800] [2024-11-07 11:14:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:18,814 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:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715890800] [2024-11-07 11:14:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715890800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:18,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:18,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:14:18,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231186320] [2024-11-07 11:14:18,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:18,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:14:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:18,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:14:18,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:14:18,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-07 11:14:18,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 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:18,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:18,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-07 11:14:18,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:19,029 INFO L124 PetriNetUnfolderBase]: 479/819 cut-off events. [2024-11-07 11:14:19,029 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-11-07 11:14:19,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 819 events. 479/819 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3669 event pairs, 61 based on Foata normal form. 36/809 useless extension candidates. Maximal degree in co-relation 2123. Up to 268 conditions per place. [2024-11-07 11:14:19,035 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 43 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2024-11-07 11:14:19,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 320 flow [2024-11-07 11:14:19,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:14:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:14:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-11-07 11:14:19,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2024-11-07 11:14:19,038 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 141 transitions. [2024-11-07 11:14:19,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 320 flow [2024-11-07 11:14:19,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 11:14:19,043 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2024-11-07 11:14:19,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-11-07 11:14:19,044 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-07 11:14:19,045 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2024-11-07 11:14:19,045 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:19,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:19,045 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:19,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:14:19,045 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:19,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:19,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1229547456, now seen corresponding path program 1 times [2024-11-07 11:14:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:19,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970586576] [2024-11-07 11:14:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:19,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:20,215 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:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:20,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970586576] [2024-11-07 11:14:20,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970586576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:20,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:20,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:14:20,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082635944] [2024-11-07 11:14:20,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:20,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:14:20,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:20,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:14:20,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:14:20,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-11-07 11:14:20,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 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:20,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:20,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-11-07 11:14:20,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:20,608 INFO L124 PetriNetUnfolderBase]: 719/1379 cut-off events. [2024-11-07 11:14:20,608 INFO L125 PetriNetUnfolderBase]: For 797/827 co-relation queries the response was YES. [2024-11-07 11:14:20,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 1379 events. 719/1379 cut-off events. For 797/827 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7691 event pairs, 178 based on Foata normal form. 8/1337 useless extension candidates. Maximal degree in co-relation 3319. Up to 405 conditions per place. [2024-11-07 11:14:20,615 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 51 selfloop transitions, 14 changer transitions 12/96 dead transitions. [2024-11-07 11:14:20,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 96 transitions, 456 flow [2024-11-07 11:14:20,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:14:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 11:14:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-11-07 11:14:20,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6324786324786325 [2024-11-07 11:14:20,617 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 9 states and 222 transitions. [2024-11-07 11:14:20,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 96 transitions, 456 flow [2024-11-07 11:14:20,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 96 transitions, 384 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-11-07 11:14:20,624 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 190 flow [2024-11-07 11:14:20,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-11-07 11:14:20,626 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2024-11-07 11:14:20,626 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 190 flow [2024-11-07 11:14:20,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 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:20,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:20,627 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:20,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:14:20,627 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:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash -571823002, now seen corresponding path program 2 times [2024-11-07 11:14:20,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:20,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661538573] [2024-11-07 11:14:20,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:20,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:20,867 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:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661538573] [2024-11-07 11:14:20,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661538573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:20,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:20,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:14:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582182356] [2024-11-07 11:14:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:20,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:14:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:20,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:14:20,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:14:20,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-07 11:14:20,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:20,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:20,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-07 11:14:20,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:21,192 INFO L124 PetriNetUnfolderBase]: 1413/2659 cut-off events. [2024-11-07 11:14:21,193 INFO L125 PetriNetUnfolderBase]: For 570/572 co-relation queries the response was YES. [2024-11-07 11:14:21,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 2659 events. 1413/2659 cut-off events. For 570/572 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17316 event pairs, 317 based on Foata normal form. 18/2565 useless extension candidates. Maximal degree in co-relation 6084. Up to 971 conditions per place. [2024-11-07 11:14:21,203 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 42 selfloop transitions, 3 changer transitions 24/91 dead transitions. [2024-11-07 11:14:21,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 91 transitions, 464 flow [2024-11-07 11:14:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:14:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:14:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-11-07 11:14:21,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.594017094017094 [2024-11-07 11:14:21,204 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 190 flow. Second operand 6 states and 139 transitions. [2024-11-07 11:14:21,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 91 transitions, 464 flow [2024-11-07 11:14:21,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 449 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-07 11:14:21,207 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 195 flow [2024-11-07 11:14:21,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-11-07 11:14:21,208 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2024-11-07 11:14:21,208 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 195 flow [2024-11-07 11:14:21,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:21,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:21,208 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:21,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:14:21,209 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:21,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:21,209 INFO L85 PathProgramCache]: Analyzing trace with hash 235005914, now seen corresponding path program 3 times [2024-11-07 11:14:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:21,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660321873] [2024-11-07 11:14:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:23,105 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:23,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:23,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660321873] [2024-11-07 11:14:23,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660321873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:23,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:23,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 11:14:23,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671293127] [2024-11-07 11:14:23,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:23,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 11:14:23,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 11:14:23,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:14:23,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-07 11:14:23,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 195 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 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:23,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:23,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-07 11:14:23,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:23,676 INFO L124 PetriNetUnfolderBase]: 1061/1994 cut-off events. [2024-11-07 11:14:23,677 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2024-11-07 11:14:23,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4654 conditions, 1994 events. 1061/1994 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11788 event pairs, 271 based on Foata normal form. 16/1925 useless extension candidates. Maximal degree in co-relation 4636. Up to 732 conditions per place. [2024-11-07 11:14:23,685 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 47 selfloop transitions, 12 changer transitions 32/108 dead transitions. [2024-11-07 11:14:23,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 108 transitions, 549 flow [2024-11-07 11:14:23,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 11:14:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 11:14:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2024-11-07 11:14:23,687 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-11-07 11:14:23,687 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 195 flow. Second operand 10 states and 216 transitions. [2024-11-07 11:14:23,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 108 transitions, 549 flow [2024-11-07 11:14:23,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 108 transitions, 527 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-07 11:14:23,689 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 264 flow [2024-11-07 11:14:23,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=264, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-11-07 11:14:23,690 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-11-07 11:14:23,690 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 264 flow [2024-11-07 11:14:23,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 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:23,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:23,691 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:23,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:14:23,691 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:23,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1546837748, now seen corresponding path program 4 times [2024-11-07 11:14:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366516349] [2024-11-07 11:14:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:23,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:23,967 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:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366516349] [2024-11-07 11:14:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366516349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:23,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:23,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:14:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074402329] [2024-11-07 11:14:23,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:23,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:14:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:14:23,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:14:23,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-07 11:14:23,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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:23,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:23,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-07 11:14:23,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:24,219 INFO L124 PetriNetUnfolderBase]: 1022/1886 cut-off events. [2024-11-07 11:14:24,220 INFO L125 PetriNetUnfolderBase]: For 1623/1636 co-relation queries the response was YES. [2024-11-07 11:14:24,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4933 conditions, 1886 events. 1022/1886 cut-off events. For 1623/1636 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11251 event pairs, 303 based on Foata normal form. 24/1828 useless extension candidates. Maximal degree in co-relation 4911. Up to 797 conditions per place. [2024-11-07 11:14:24,228 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 30 selfloop transitions, 3 changer transitions 42/93 dead transitions. [2024-11-07 11:14:24,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 542 flow [2024-11-07 11:14:24,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:14:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:14:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-11-07 11:14:24,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2024-11-07 11:14:24,229 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 264 flow. Second operand 6 states and 138 transitions. [2024-11-07 11:14:24,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 542 flow [2024-11-07 11:14:24,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 522 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-07 11:14:24,234 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 183 flow [2024-11-07 11:14:24,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2024-11-07 11:14:24,236 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2024-11-07 11:14:24,236 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 183 flow [2024-11-07 11:14:24,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:24,236 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:24,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:14:24,236 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:24,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash -58772970, now seen corresponding path program 5 times [2024-11-07 11:14:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:24,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159724945] [2024-11-07 11:14:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:24,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:14:24,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:14:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:14:24,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:14:24,358 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:14:24,359 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-07 11:14:24,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-07 11:14:24,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-07 11:14:24,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-07 11:14:24,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-07 11:14:24,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-07 11:14:24,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 11:14:24,361 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-11-07 11:14:24,418 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:14:24,418 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:14:24,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:14:24 BasicIcfg [2024-11-07 11:14:24,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:14:24,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:14:24,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:14:24,423 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:14:24,424 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:16" (3/4) ... [2024-11-07 11:14:24,424 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 11:14:24,506 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:14:24,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:14:24,508 INFO L158 Benchmark]: Toolchain (without parser) took 8997.10ms. Allocated memory was 109.1MB in the beginning and 369.1MB in the end (delta: 260.0MB). Free memory was 84.3MB in the beginning and 333.4MB in the end (delta: -249.1MB). Peak memory consumption was 220.4MB. Max. memory is 16.1GB. [2024-11-07 11:14:24,508 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:14:24,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.55ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 60.8MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 11:14:24,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.47ms. Allocated memory is still 109.1MB. Free memory was 60.8MB in the beginning and 58.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:14:24,508 INFO L158 Benchmark]: Boogie Preprocessor took 50.49ms. Allocated memory is still 109.1MB. Free memory was 58.4MB in the beginning and 55.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:14:24,508 INFO L158 Benchmark]: RCFGBuilder took 570.06ms. Allocated memory is still 109.1MB. Free memory was 55.3MB in the beginning and 50.4MB in the end (delta: 4.9MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-07 11:14:24,508 INFO L158 Benchmark]: TraceAbstraction took 7883.84ms. Allocated memory was 109.1MB in the beginning and 369.1MB in the end (delta: 260.0MB). Free memory was 49.8MB in the beginning and 137.5MB in the end (delta: -87.7MB). Peak memory consumption was 172.3MB. Max. memory is 16.1GB. [2024-11-07 11:14:24,509 INFO L158 Benchmark]: Witness Printer took 83.63ms. Allocated memory is still 369.1MB. Free memory was 137.5MB in the beginning and 333.4MB in the end (delta: -195.9MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-07 11:14:24,511 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.26ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.55ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 60.8MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.47ms. Allocated memory is still 109.1MB. Free memory was 60.8MB in the beginning and 58.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.49ms. Allocated memory is still 109.1MB. Free memory was 58.4MB in the beginning and 55.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 570.06ms. Allocated memory is still 109.1MB. Free memory was 55.3MB in the beginning and 50.4MB in the end (delta: 4.9MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7883.84ms. Allocated memory was 109.1MB in the beginning and 369.1MB in the end (delta: 260.0MB). Free memory was 49.8MB in the beginning and 137.5MB in the end (delta: -87.7MB). Peak memory consumption was 172.3MB. Max. memory is 16.1GB. * Witness Printer took 83.63ms. Allocated memory is still 369.1MB. Free memory was 137.5MB in the beginning and 333.4MB in the end (delta: -195.9MB). Peak memory consumption was 18.0MB. 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-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] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-1, t1962=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] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-1, t1962=0, t1963=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=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] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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] [L772] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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] [L775] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L778] 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) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 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 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 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_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L792] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, 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] [L795] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, 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] [L798] 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) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 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 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 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_p1_EAX=1, __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=1, 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] [L758] 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) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 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 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 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_p1_EAX=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=1, 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] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __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=1, 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] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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=1, 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] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, 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] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-1, t1962=0, t1963=1, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 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) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 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 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-1, t1962=0, t1963=1, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 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) [L843] 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)) [L844] 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)) [L845] 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)) [L846] 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)) [L847] 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)) [L848] 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)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-1, t1962=0, t1963=1, weak$$choice0=0, weak$$choice2=1, x=1, 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] [L853] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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: 825]: 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: 7.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 278 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1143 IncrementalHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 23 mSDtfsCounter, 1143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=7, InterpolantAutomatonStates: 49, 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, 4.1s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 1538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:24,533 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