./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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', '0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8'] 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:13:06,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:13:07,011 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:13:07,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:13:07,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:13:07,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:13:07,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:13:07,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:13:07,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:13:07,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:13:07,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:13:07,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:13:07,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:13:07,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:13:07,050 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:13:07,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:13:07,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:13:07,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:13:07,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:13:07,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:13:07,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:13:07,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:13:07,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:13:07,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:13:07,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:13:07,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:13:07,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:13:07,052 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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2024-11-07 11:13:07,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:13:07,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:13:07,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:13:07,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:13:07,322 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:13:07,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 11:13:08,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:13:08,743 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:13:08,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 11:13:08,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c70737cb4/3c86d5068241456a84cf71a8da4d24c4/FLAG00237addc [2024-11-07 11:13:09,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c70737cb4/3c86d5068241456a84cf71a8da4d24c4 [2024-11-07 11:13:09,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:13:09,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:13:09,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:13:09,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:13:09,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:13:09,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578aed95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09, skipping insertion in model container [2024-11-07 11:13:09,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:13:09,248 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2024-11-07 11:13:09,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:13:09,383 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:13:09,398 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2024-11-07 11:13:09,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:13:09,494 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:13:09,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09 WrapperNode [2024-11-07 11:13:09,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:13:09,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:13:09,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:13:09,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:13:09,503 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:13:09" (1/1) ... [2024-11-07 11:13:09,521 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:13:09" (1/1) ... [2024-11-07 11:13:09,547 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-07 11:13:09,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:13:09,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:13:09,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:13:09,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:13:09,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,586 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:13:09,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:13:09,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:13:09,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:13:09,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:13:09,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (1/1) ... [2024-11-07 11:13:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:13:09,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:13:09,642 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:13:09,645 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:13:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 11:13:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:13:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 11:13:09,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 11:13:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 11:13:09,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 11:13:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 11:13:09,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 11:13:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:13:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 11:13:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:13:09,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:13:09,666 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:13:09,759 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:13:09,760 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:13:09,977 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:13:09,977 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:13:10,143 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:13:10,143 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 11:13:10,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:13:10 BoogieIcfgContainer [2024-11-07 11:13:10,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:13:10,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:13:10,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:13:10,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:13:10,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:13:09" (1/3) ... [2024-11-07 11:13:10,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79da68c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:13:10, skipping insertion in model container [2024-11-07 11:13:10,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:09" (2/3) ... [2024-11-07 11:13:10,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79da68c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:13:10, skipping insertion in model container [2024-11-07 11:13:10,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:13:10" (3/3) ... [2024-11-07 11:13:10,151 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-07 11:13:10,161 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:13:10,162 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 11:13:10,162 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:13:10,199 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:13:10,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-07 11:13:10,247 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-07 11:13:10,250 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:13:10,253 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 5. Compared 69 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:13:10,254 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-07 11:13:10,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-07 11:13:10,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:13:10,276 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;@77a18a02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:13:10,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 11:13:10,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:13:10,281 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-11-07 11:13:10,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:13:10,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:10,282 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:10,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:13:10,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash -618549366, now seen corresponding path program 1 times [2024-11-07 11:13:10,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:10,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931197414] [2024-11-07 11:13:10,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:10,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:10,648 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:13:10,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:10,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931197414] [2024-11-07 11:13:10,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931197414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:10,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:10,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 11:13:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141226519] [2024-11-07 11:13:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:10,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:13:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:10,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:13:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:13:10,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39 [2024-11-07 11:13:10,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:13:10,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:10,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39 [2024-11-07 11:13:10,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:10,986 INFO L124 PetriNetUnfolderBase]: 315/627 cut-off events. [2024-11-07 11:13:10,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:13:10,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 627 events. 315/627 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4050 event pairs, 60 based on Foata normal form. 24/634 useless extension candidates. Maximal degree in co-relation 1139. Up to 382 conditions per place. [2024-11-07 11:13:10,999 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 23 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-11-07 11:13:10,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 149 flow [2024-11-07 11:13:11,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:13:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 11:13:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-07 11:13:11,015 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-11-07 11:13:11,016 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 87 transitions. [2024-11-07 11:13:11,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 149 flow [2024-11-07 11:13:11,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 11:13:11,022 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-07 11:13:11,024 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:13:11,028 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-07 11:13:11,028 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-07 11:13:11,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:13:11,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:11,029 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:11,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:13:11,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:13:11,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:11,031 INFO L85 PathProgramCache]: Analyzing trace with hash -831155273, now seen corresponding path program 1 times [2024-11-07 11:13:11,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:11,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648820264] [2024-11-07 11:13:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:11,324 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:13:11,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:11,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648820264] [2024-11-07 11:13:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648820264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:11,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:11,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:13:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532613365] [2024-11-07 11:13:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:11,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:13:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:13:11,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:13:11,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-07 11:13:11,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:13:11,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:11,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-07 11:13:11,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:11,594 INFO L124 PetriNetUnfolderBase]: 899/1553 cut-off events. [2024-11-07 11:13:11,595 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-11-07 11:13:11,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 1553 events. 899/1553 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9466 event pairs, 94 based on Foata normal form. 60/1551 useless extension candidates. Maximal degree in co-relation 3045. Up to 846 conditions per place. [2024-11-07 11:13:11,610 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 36 selfloop transitions, 5 changer transitions 1/54 dead transitions. [2024-11-07 11:13:11,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 210 flow [2024-11-07 11:13:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:13:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:13:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-11-07 11:13:11,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-07 11:13:11,613 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 104 transitions. [2024-11-07 11:13:11,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 210 flow [2024-11-07 11:13:11,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:13:11,615 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2024-11-07 11:13:11,615 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:13:11,616 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-11-07 11:13:11,616 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2024-11-07 11:13:11,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:13:11,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:11,617 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:13:11,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:13:11,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:13:11,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1989030113, now seen corresponding path program 1 times [2024-11-07 11:13:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:11,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217375046] [2024-11-07 11:13:11,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:11,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217375046] [2024-11-07 11:13:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217375046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:11,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:13:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733359562] [2024-11-07 11:13:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:13:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:13:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:13:11,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-07 11:13:11,847 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.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:11,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:11,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-07 11:13:11,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:12,088 INFO L124 PetriNetUnfolderBase]: 628/1100 cut-off events. [2024-11-07 11:13:12,088 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2024-11-07 11:13:12,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 1100 events. 628/1100 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6016 event pairs, 34 based on Foata normal form. 54/1114 useless extension candidates. Maximal degree in co-relation 2527. Up to 461 conditions per place. [2024-11-07 11:13:12,095 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 45 selfloop transitions, 8 changer transitions 1/66 dead transitions. [2024-11-07 11:13:12,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 295 flow [2024-11-07 11:13:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:13:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:13:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-11-07 11:13:12,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2024-11-07 11:13:12,099 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 131 transitions. [2024-11-07 11:13:12,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 295 flow [2024-11-07 11:13:12,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 285 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 11:13:12,102 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2024-11-07 11:13:12,102 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:13:12,103 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-11-07 11:13:12,103 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2024-11-07 11:13:12,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:12,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:12,103 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:13:12,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:13:12,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:13:12,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:12,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1258336949, now seen corresponding path program 1 times [2024-11-07 11:13:12,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:12,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941127671] [2024-11-07 11:13:12,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:12,319 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:13:12,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:12,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941127671] [2024-11-07 11:13:12,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941127671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:12,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:12,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:13:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521637624] [2024-11-07 11:13:12,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:12,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:13:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:13:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:13:12,325 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-07 11:13:12,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:13:12,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:12,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-07 11:13:12,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:12,493 INFO L124 PetriNetUnfolderBase]: 357/615 cut-off events. [2024-11-07 11:13:12,493 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2024-11-07 11:13:12,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 615 events. 357/615 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2693 event pairs, 23 based on Foata normal form. 32/631 useless extension candidates. Maximal degree in co-relation 1639. Up to 228 conditions per place. [2024-11-07 11:13:12,497 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 40 selfloop transitions, 11 changer transitions 1/64 dead transitions. [2024-11-07 11:13:12,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 310 flow [2024-11-07 11:13:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:13:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:13:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-11-07 11:13:12,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-11-07 11:13:12,498 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 144 transitions. [2024-11-07 11:13:12,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 310 flow [2024-11-07 11:13:12,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 285 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 11:13:12,502 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2024-11-07 11:13:12,502 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:13:12,503 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-07 11:13:12,503 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2024-11-07 11:13:12,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:13:12,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:12,503 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:13:12,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:13:12,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:13:12,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash -185793545, now seen corresponding path program 1 times [2024-11-07 11:13:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789628053] [2024-11-07 11:13:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:12,762 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:13:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:12,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789628053] [2024-11-07 11:13:12,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789628053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:12,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:12,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:13:12,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809668143] [2024-11-07 11:13:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:12,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:13:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:13:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:13:12,770 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-11-07 11:13:12,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:12,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:12,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-11-07 11:13:12,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:12,979 INFO L124 PetriNetUnfolderBase]: 488/969 cut-off events. [2024-11-07 11:13:12,980 INFO L125 PetriNetUnfolderBase]: For 468/483 co-relation queries the response was YES. [2024-11-07 11:13:12,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2227 conditions, 969 events. 488/969 cut-off events. For 468/483 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5240 event pairs, 215 based on Foata normal form. 8/907 useless extension candidates. Maximal degree in co-relation 2212. Up to 391 conditions per place. [2024-11-07 11:13:12,987 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 27 selfloop transitions, 2 changer transitions 13/61 dead transitions. [2024-11-07 11:13:12,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 300 flow [2024-11-07 11:13:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:13:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:13:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-11-07 11:13:12,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6307692307692307 [2024-11-07 11:13:12,989 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 5 states and 123 transitions. [2024-11-07 11:13:12,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 300 flow [2024-11-07 11:13:12,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 236 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-07 11:13:12,995 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 116 flow [2024-11-07 11:13:12,995 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-11-07 11:13:12,996 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-11-07 11:13:12,997 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 116 flow [2024-11-07 11:13:12,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:12,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:12,998 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:13:12,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:13:12,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:13:12,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash -826204889, now seen corresponding path program 2 times [2024-11-07 11:13:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105180937] [2024-11-07 11:13:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:13,749 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:13:13,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:13,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105180937] [2024-11-07 11:13:13,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105180937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:13,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:13,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:13:13,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125140242] [2024-11-07 11:13:13,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:13,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:13:13,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:13,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:13:13,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:13:13,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-11-07 11:13:13,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 116 flow. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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:13:13,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:13,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-11-07 11:13:13,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:14,200 INFO L124 PetriNetUnfolderBase]: 547/1033 cut-off events. [2024-11-07 11:13:14,200 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-07 11:13:14,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 1033 events. 547/1033 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5173 event pairs, 108 based on Foata normal form. 8/1012 useless extension candidates. Maximal degree in co-relation 2217. Up to 379 conditions per place. [2024-11-07 11:13:14,204 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 26 selfloop transitions, 6 changer transitions 44/92 dead transitions. [2024-11-07 11:13:14,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 401 flow [2024-11-07 11:13:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 11:13:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 11:13:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2024-11-07 11:13:14,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2024-11-07 11:13:14,206 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 116 flow. Second operand 11 states and 220 transitions. [2024-11-07 11:13:14,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 401 flow [2024-11-07 11:13:14,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 92 transitions, 377 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 11:13:14,208 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 148 flow [2024-11-07 11:13:14,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=148, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2024-11-07 11:13:14,209 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2024-11-07 11:13:14,209 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 148 flow [2024-11-07 11:13:14,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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:13:14,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:14,209 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:13:14,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:13:14,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:13:14,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash 661043883, now seen corresponding path program 3 times [2024-11-07 11:13:14,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:14,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006662422] [2024-11-07 11:13:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:15,237 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:13:15,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:15,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006662422] [2024-11-07 11:13:15,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006662422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:15,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:13:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766042738] [2024-11-07 11:13:15,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:15,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:13:15,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:13:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:13:15,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-07 11:13:15,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 148 flow. Second operand has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 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:13:15,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:15,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-07 11:13:15,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:15,566 INFO L124 PetriNetUnfolderBase]: 354/699 cut-off events. [2024-11-07 11:13:15,567 INFO L125 PetriNetUnfolderBase]: For 161/165 co-relation queries the response was YES. [2024-11-07 11:13:15,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 699 events. 354/699 cut-off events. For 161/165 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3374 event pairs, 102 based on Foata normal form. 8/674 useless extension candidates. Maximal degree in co-relation 1530. Up to 283 conditions per place. [2024-11-07 11:13:15,570 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 22 selfloop transitions, 6 changer transitions 16/61 dead transitions. [2024-11-07 11:13:15,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 287 flow [2024-11-07 11:13:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:13:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 11:13:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-11-07 11:13:15,572 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-11-07 11:13:15,572 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 148 flow. Second operand 7 states and 143 transitions. [2024-11-07 11:13:15,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 287 flow [2024-11-07 11:13:15,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 266 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-11-07 11:13:15,573 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 142 flow [2024-11-07 11:13:15,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2024-11-07 11:13:15,574 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2024-11-07 11:13:15,574 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 142 flow [2024-11-07 11:13:15,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 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:13:15,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:15,576 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:13:15,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:13:15,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:13:15,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1494715311, now seen corresponding path program 4 times [2024-11-07 11:13:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386800906] [2024-11-07 11:13:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:15,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:13:15,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:13:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:13:15,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:13:15,694 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:13:15,694 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-07 11:13:15,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-07 11:13:15,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-07 11:13:15,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-07 11:13:15,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-07 11:13:15,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-07 11:13:15,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:13:15,700 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-07 11:13:15,760 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:13:15,760 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:13:15,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:13:15 BasicIcfg [2024-11-07 11:13:15,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:13:15,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:13:15,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:13:15,768 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:13:15,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:13:10" (3/4) ... [2024-11-07 11:13:15,769 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 11:13:15,821 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:13:15,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:13:15,822 INFO L158 Benchmark]: Toolchain (without parser) took 6741.55ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 116.6MB in the beginning and 197.5MB in the end (delta: -80.9MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2024-11-07 11:13:15,822 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:13:15,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.55ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 93.5MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 11:13:15,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.00ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:13:15,823 INFO L158 Benchmark]: Boogie Preprocessor took 59.68ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 88.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:13:15,823 INFO L158 Benchmark]: RCFGBuilder took 531.58ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 110.0MB in the end (delta: -21.8MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2024-11-07 11:13:15,823 INFO L158 Benchmark]: TraceAbstraction took 5622.17ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 109.3MB in the beginning and 208.9MB in the end (delta: -99.6MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-11-07 11:13:15,823 INFO L158 Benchmark]: Witness Printer took 53.90ms. Allocated memory is still 276.8MB. Free memory was 205.9MB in the beginning and 197.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:13:15,824 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.81ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.55ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 93.5MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.00ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.68ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 88.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 531.58ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 110.0MB in the end (delta: -21.8MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5622.17ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 109.3MB in the beginning and 208.9MB in the end (delta: -99.6MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 53.90ms. Allocated memory is still 276.8MB. Free memory was 205.9MB in the beginning and 197.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, t1493=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492=-1, t1493=0, t1494=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 816]: 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: 818]: 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: 5.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 383 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 705 IncrementalHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 16 mSDtfsCounter, 705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=4, InterpolantAutomatonStates: 41, 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.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 921 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:13:15,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE