./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longest-2.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/triangular-longest-2.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', '874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108'] 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/triangular-longest-2.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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:06:45,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:06:45,813 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:06:45,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:06:45,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:06:45,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:06:45,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:06:45,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:06:45,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:06:45,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:06:45,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:06:45,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:06:45,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:06:45,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:06:45,858 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:06:45,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:06:45,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:06:45,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:06:45,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:06:45,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:06:45,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:06:45,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:06:45,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:06:45,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:06:45,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:06:45,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:06:45,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:06:45,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:06:45,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:06:45,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:06:45,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:06:45,862 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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2024-11-07 11:06:46,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:06:46,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:06:46,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:06:46,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:06:46,139 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:06:46,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-2.i [2024-11-07 11:06:47,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:06:47,665 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:06:47,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i [2024-11-07 11:06:47,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2b390d3c/7a25ab9dd9134135a033902e13e32b77/FLAG4a83d56e3 [2024-11-07 11:06:47,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2b390d3c/7a25ab9dd9134135a033902e13e32b77 [2024-11-07 11:06:47,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:06:47,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:06:47,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:06:47,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:06:47,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:06:47,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:06:47" (1/1) ... [2024-11-07 11:06:47,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73536e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:47, skipping insertion in model container [2024-11-07 11:06:47,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:06:47" (1/1) ... [2024-11-07 11:06:47,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:06:48,005 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/triangular-longest-2.i[30964,30977] [2024-11-07 11:06:48,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:06:48,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:06:48,059 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/triangular-longest-2.i[30964,30977] [2024-11-07 11:06:48,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:06:48,097 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:06:48,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48 WrapperNode [2024-11-07 11:06:48,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:06:48,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:06:48,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:06:48,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:06:48,104 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:06:48" (1/1) ... [2024-11-07 11:06:48,119 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:06:48" (1/1) ... [2024-11-07 11:06:48,137 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-07 11:06:48,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:06:48,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:06:48,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:06:48,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:06:48,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (1/1) ... [2024-11-07 11:06:48,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (1/1) ... [2024-11-07 11:06:48,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (1/1) ... [2024-11-07 11:06:48,168 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:06:48,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (1/1) ... [2024-11-07 11:06:48,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (1/1) ... [2024-11-07 11:06:48,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (1/1) ... [2024-11-07 11:06:48,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (1/1) ... [2024-11-07 11:06:48,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (1/1) ... [2024-11-07 11:06:48,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (1/1) ... [2024-11-07 11:06:48,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:06:48,192 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:06:48,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:06:48,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:06:48,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (1/1) ... [2024-11-07 11:06:48,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:06:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:06:48,228 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:06:48,235 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:06:48,254 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-07 11:06:48,255 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-07 11:06:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-07 11:06:48,255 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-07 11:06:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 11:06:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:06:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:06:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 11:06:48,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:06:48,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:06:48,259 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:06:48,394 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:06:48,395 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:06:48,510 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:06:48,511 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:06:48,587 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:06:48,587 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 11:06:48,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:06:48 BoogieIcfgContainer [2024-11-07 11:06:48,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:06:48,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:06:48,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:06:48,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:06:48,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:06:47" (1/3) ... [2024-11-07 11:06:48,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e21fab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:06:48, skipping insertion in model container [2024-11-07 11:06:48,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:06:48" (2/3) ... [2024-11-07 11:06:48,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e21fab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:06:48, skipping insertion in model container [2024-11-07 11:06:48,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:06:48" (3/3) ... [2024-11-07 11:06:48,597 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2024-11-07 11:06:48,612 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:06:48,613 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:06:48,613 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:06:48,665 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:06:48,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2024-11-07 11:06:48,760 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-11-07 11:06:48,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:06:48,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-07 11:06:48,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2024-11-07 11:06:48,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2024-11-07 11:06:48,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:06:48,791 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;@541073cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:06:48,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-07 11:06:48,803 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:06:48,804 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-07 11:06:48,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:06:48,804 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:48,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:48,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:48,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash 762204344, now seen corresponding path program 1 times [2024-11-07 11:06:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:48,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310830135] [2024-11-07 11:06:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:48,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:49,263 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:06:49,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:49,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310830135] [2024-11-07 11:06:49,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310830135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:06:49,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:06:49,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:06:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032172325] [2024-11-07 11:06:49,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:06:49,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:06:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:49,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:06:49,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:06:49,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:49,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:06:49,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:49,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:49,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:49,590 INFO L124 PetriNetUnfolderBase]: 321/543 cut-off events. [2024-11-07 11:06:49,592 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 11:06:49,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 543 events. 321/543 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2179 event pairs, 62 based on Foata normal form. 12/542 useless extension candidates. Maximal degree in co-relation 1045. Up to 221 conditions per place. [2024-11-07 11:06:49,598 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2024-11-07 11:06:49,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2024-11-07 11:06:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:06:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:06:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-11-07 11:06:49,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-07 11:06:49,615 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2024-11-07 11:06:49,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2024-11-07 11:06:49,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:06:49,621 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2024-11-07 11:06:49,623 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2024-11-07 11:06:49,626 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2024-11-07 11:06:49,626 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2024-11-07 11:06:49,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:06:49,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:49,627 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:49,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:06:49,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:49,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1754207660, now seen corresponding path program 1 times [2024-11-07 11:06:49,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:49,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961792855] [2024-11-07 11:06:49,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:49,802 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:06:49,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:49,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961792855] [2024-11-07 11:06:49,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961792855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:06:49,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:06:49,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:06:49,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027289662] [2024-11-07 11:06:49,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:06:49,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:06:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:06:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:06:49,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:49,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:06:49,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:49,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:49,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:50,092 INFO L124 PetriNetUnfolderBase]: 382/689 cut-off events. [2024-11-07 11:06:50,092 INFO L125 PetriNetUnfolderBase]: For 285/291 co-relation queries the response was YES. [2024-11-07 11:06:50,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 689 events. 382/689 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2915 event pairs, 65 based on Foata normal form. 33/721 useless extension candidates. Maximal degree in co-relation 1572. Up to 246 conditions per place. [2024-11-07 11:06:50,098 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2024-11-07 11:06:50,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2024-11-07 11:06:50,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:06:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 11:06:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-11-07 11:06:50,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-07 11:06:50,099 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2024-11-07 11:06:50,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2024-11-07 11:06:50,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-07 11:06:50,104 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2024-11-07 11:06:50,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-11-07 11:06:50,106 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2024-11-07 11:06:50,106 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2024-11-07 11:06:50,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:06:50,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:50,107 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:50,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:06:50,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:50,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:50,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2024183696, now seen corresponding path program 2 times [2024-11-07 11:06:50,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:50,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333553839] [2024-11-07 11:06:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:50,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:50,283 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:06:50,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:50,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333553839] [2024-11-07 11:06:50,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333553839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:06:50,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:06:50,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:06:50,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593705149] [2024-11-07 11:06:50,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:06:50,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:06:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:50,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:06:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:06:50,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:50,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:06:50,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:50,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:50,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:50,516 INFO L124 PetriNetUnfolderBase]: 328/605 cut-off events. [2024-11-07 11:06:50,517 INFO L125 PetriNetUnfolderBase]: For 1001/1013 co-relation queries the response was YES. [2024-11-07 11:06:50,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 605 events. 328/605 cut-off events. For 1001/1013 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2538 event pairs, 65 based on Foata normal form. 57/661 useless extension candidates. Maximal degree in co-relation 1713. Up to 234 conditions per place. [2024-11-07 11:06:50,521 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2024-11-07 11:06:50,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2024-11-07 11:06:50,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:06:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:06:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-11-07 11:06:50,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-11-07 11:06:50,522 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2024-11-07 11:06:50,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2024-11-07 11:06:50,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-07 11:06:50,528 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2024-11-07 11:06:50,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2024-11-07 11:06:50,529 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2024-11-07 11:06:50,529 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2024-11-07 11:06:50,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:06:50,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:50,529 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:50,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:06:50,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:50,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:50,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1063992253, now seen corresponding path program 1 times [2024-11-07 11:06:50,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:50,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016354103] [2024-11-07 11:06:50,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:50,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:50,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:50,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016354103] [2024-11-07 11:06:50,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016354103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:06:50,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:06:50,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:06:50,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401316408] [2024-11-07 11:06:50,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:06:50,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:06:50,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:50,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:06:50,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:06:50,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:50,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:06:50,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:50,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:50,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:50,918 INFO L124 PetriNetUnfolderBase]: 355/659 cut-off events. [2024-11-07 11:06:50,918 INFO L125 PetriNetUnfolderBase]: For 1815/1827 co-relation queries the response was YES. [2024-11-07 11:06:50,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 659 events. 355/659 cut-off events. For 1815/1827 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2860 event pairs, 80 based on Foata normal form. 21/679 useless extension candidates. Maximal degree in co-relation 2039. Up to 258 conditions per place. [2024-11-07 11:06:50,923 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 43 selfloop transitions, 16 changer transitions 21/83 dead transitions. [2024-11-07 11:06:50,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 597 flow [2024-11-07 11:06:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:06:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 11:06:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-11-07 11:06:50,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2024-11-07 11:06:50,928 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 9 states and 113 transitions. [2024-11-07 11:06:50,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 597 flow [2024-11-07 11:06:50,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 527 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-11-07 11:06:50,940 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 297 flow [2024-11-07 11:06:50,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=297, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-07 11:06:50,942 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2024-11-07 11:06:50,942 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 297 flow [2024-11-07 11:06:50,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:06:50,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:50,943 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:50,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:06:50,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:50,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1744668785, now seen corresponding path program 2 times [2024-11-07 11:06:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:50,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285775623] [2024-11-07 11:06:50,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:50,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:51,061 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:06:51,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:51,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285775623] [2024-11-07 11:06:51,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285775623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:06:51,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:06:51,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:06:51,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821171048] [2024-11-07 11:06:51,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:06:51,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:06:51,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:51,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:06:51,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:06:51,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:51,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:06:51,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:51,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:51,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:51,356 INFO L124 PetriNetUnfolderBase]: 526/971 cut-off events. [2024-11-07 11:06:51,356 INFO L125 PetriNetUnfolderBase]: For 3328/3340 co-relation queries the response was YES. [2024-11-07 11:06:51,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3187 conditions, 971 events. 526/971 cut-off events. For 3328/3340 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4538 event pairs, 53 based on Foata normal form. 39/1007 useless extension candidates. Maximal degree in co-relation 3160. Up to 256 conditions per place. [2024-11-07 11:06:51,365 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 57 selfloop transitions, 22 changer transitions 23/105 dead transitions. [2024-11-07 11:06:51,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 793 flow [2024-11-07 11:06:51,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 11:06:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 11:06:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-11-07 11:06:51,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2024-11-07 11:06:51,368 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 297 flow. Second operand 11 states and 141 transitions. [2024-11-07 11:06:51,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 793 flow [2024-11-07 11:06:51,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 733 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-11-07 11:06:51,379 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 407 flow [2024-11-07 11:06:51,379 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=407, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-11-07 11:06:51,381 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 38 predicate places. [2024-11-07 11:06:51,381 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 407 flow [2024-11-07 11:06:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:06:51,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:51,382 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:51,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:06:51,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:51,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1091700605, now seen corresponding path program 3 times [2024-11-07 11:06:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:51,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447258796] [2024-11-07 11:06:51,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:51,534 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:06:51,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447258796] [2024-11-07 11:06:51,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447258796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:06:51,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:06:51,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:06:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917381596] [2024-11-07 11:06:51,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:06:51,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:06:51,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:51,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:06:51,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:06:51,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:51,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:06:51,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:51,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:51,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:51,812 INFO L124 PetriNetUnfolderBase]: 499/926 cut-off events. [2024-11-07 11:06:51,812 INFO L125 PetriNetUnfolderBase]: For 5506/5518 co-relation queries the response was YES. [2024-11-07 11:06:51,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3520 conditions, 926 events. 499/926 cut-off events. For 5506/5518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4319 event pairs, 59 based on Foata normal form. 57/980 useless extension candidates. Maximal degree in co-relation 3487. Up to 157 conditions per place. [2024-11-07 11:06:51,820 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 45 selfloop transitions, 27 changer transitions 33/108 dead transitions. [2024-11-07 11:06:51,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 999 flow [2024-11-07 11:06:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 11:06:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 11:06:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-11-07 11:06:51,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2024-11-07 11:06:51,822 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 407 flow. Second operand 11 states and 138 transitions. [2024-11-07 11:06:51,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 999 flow [2024-11-07 11:06:51,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 931 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-11-07 11:06:51,850 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 514 flow [2024-11-07 11:06:51,850 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=514, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2024-11-07 11:06:51,851 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 46 predicate places. [2024-11-07 11:06:51,851 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 514 flow [2024-11-07 11:06:51,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:06:51,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:51,852 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:51,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:06:51,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:51,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:51,852 INFO L85 PathProgramCache]: Analyzing trace with hash 391260105, now seen corresponding path program 1 times [2024-11-07 11:06:51,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:51,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670460445] [2024-11-07 11:06:51,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:51,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:51,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670460445] [2024-11-07 11:06:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670460445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:06:51,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989758522] [2024-11-07 11:06:51,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:51,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:06:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:06:51,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:06:51,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 11:06:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:52,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 11:06:52,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:06:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:52,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:06:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:52,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989758522] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 11:06:52,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 11:06:52,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-07 11:06:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139009547] [2024-11-07 11:06:52,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 11:06:52,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 11:06:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:52,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 11:06:52,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:06:52,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:52,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 514 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:06:52,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:52,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:52,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:52,848 INFO L124 PetriNetUnfolderBase]: 607/1136 cut-off events. [2024-11-07 11:06:52,849 INFO L125 PetriNetUnfolderBase]: For 10981/10993 co-relation queries the response was YES. [2024-11-07 11:06:52,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4889 conditions, 1136 events. 607/1136 cut-off events. For 10981/10993 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5008 event pairs, 149 based on Foata normal form. 75/1210 useless extension candidates. Maximal degree in co-relation 4852. Up to 522 conditions per place. [2024-11-07 11:06:52,858 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 67 selfloop transitions, 19 changer transitions 67/156 dead transitions. [2024-11-07 11:06:52,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 156 transitions, 1590 flow [2024-11-07 11:06:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 11:06:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-07 11:06:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2024-11-07 11:06:52,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2024-11-07 11:06:52,860 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 514 flow. Second operand 19 states and 231 transitions. [2024-11-07 11:06:52,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 156 transitions, 1590 flow [2024-11-07 11:06:52,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 156 transitions, 1489 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-11-07 11:06:52,878 INFO L231 Difference]: Finished difference. Result has 92 places, 56 transitions, 646 flow [2024-11-07 11:06:52,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=646, PETRI_PLACES=92, PETRI_TRANSITIONS=56} [2024-11-07 11:06:52,879 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 66 predicate places. [2024-11-07 11:06:52,879 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 56 transitions, 646 flow [2024-11-07 11:06:52,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:06:52,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:52,879 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:52,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 11:06:53,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:06:53,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:53,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:53,081 INFO L85 PathProgramCache]: Analyzing trace with hash -827216793, now seen corresponding path program 2 times [2024-11-07 11:06:53,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:53,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677097142] [2024-11-07 11:06:53,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:53,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:53,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677097142] [2024-11-07 11:06:53,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677097142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:06:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86922542] [2024-11-07 11:06:53,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 11:06:53,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:06:53,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:06:53,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:06:53,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 11:06:53,257 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 11:06:53,257 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 11:06:53,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 11:06:53,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:06:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:53,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:06:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86922542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 11:06:53,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 11:06:53,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-07 11:06:53,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909187147] [2024-11-07 11:06:53,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 11:06:53,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 11:06:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:53,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 11:06:53,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:06:53,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:53,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 56 transitions, 646 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:06:53,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:53,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:53,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:54,139 INFO L124 PetriNetUnfolderBase]: 895/1655 cut-off events. [2024-11-07 11:06:54,139 INFO L125 PetriNetUnfolderBase]: For 37310/37322 co-relation queries the response was YES. [2024-11-07 11:06:54,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9389 conditions, 1655 events. 895/1655 cut-off events. For 37310/37322 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8056 event pairs, 68 based on Foata normal form. 84/1738 useless extension candidates. Maximal degree in co-relation 9342. Up to 315 conditions per place. [2024-11-07 11:06:54,156 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 88 selfloop transitions, 49 changer transitions 80/220 dead transitions. [2024-11-07 11:06:54,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 220 transitions, 2852 flow [2024-11-07 11:06:54,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 11:06:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-07 11:06:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 334 transitions. [2024-11-07 11:06:54,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-11-07 11:06:54,158 INFO L175 Difference]: Start difference. First operand has 92 places, 56 transitions, 646 flow. Second operand 27 states and 334 transitions. [2024-11-07 11:06:54,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 220 transitions, 2852 flow [2024-11-07 11:06:54,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 220 transitions, 2305 flow, removed 261 selfloop flow, removed 12 redundant places. [2024-11-07 11:06:54,189 INFO L231 Difference]: Finished difference. Result has 118 places, 72 transitions, 1051 flow [2024-11-07 11:06:54,190 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1051, PETRI_PLACES=118, PETRI_TRANSITIONS=72} [2024-11-07 11:06:54,190 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 92 predicate places. [2024-11-07 11:06:54,190 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 72 transitions, 1051 flow [2024-11-07 11:06:54,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:06:54,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:54,191 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:54,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 11:06:54,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:06:54,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:54,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:54,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1859448120, now seen corresponding path program 1 times [2024-11-07 11:06:54,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:54,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103215750] [2024-11-07 11:06:54,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:54,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:54,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:54,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103215750] [2024-11-07 11:06:54,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103215750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:06:54,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035182463] [2024-11-07 11:06:54,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:54,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:06:54,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:06:54,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:06:54,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 11:06:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:54,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 11:06:54,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:06:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:54,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:06:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035182463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 11:06:54,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 11:06:54,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-07 11:06:54,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097988689] [2024-11-07 11:06:54,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 11:06:54,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 11:06:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:54,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 11:06:54,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-07 11:06:54,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:54,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 72 transitions, 1051 flow. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:06:54,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:54,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:54,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:55,585 INFO L124 PetriNetUnfolderBase]: 1129/2124 cut-off events. [2024-11-07 11:06:55,586 INFO L125 PetriNetUnfolderBase]: For 87490/87496 co-relation queries the response was YES. [2024-11-07 11:06:55,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14779 conditions, 2124 events. 1129/2124 cut-off events. For 87490/87496 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 11104 event pairs, 153 based on Foata normal form. 69/2190 useless extension candidates. Maximal degree in co-relation 14720. Up to 490 conditions per place. [2024-11-07 11:06:55,613 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 99 selfloop transitions, 53 changer transitions 67/222 dead transitions. [2024-11-07 11:06:55,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 222 transitions, 3667 flow [2024-11-07 11:06:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 11:06:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-07 11:06:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 309 transitions. [2024-11-07 11:06:55,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-11-07 11:06:55,616 INFO L175 Difference]: Start difference. First operand has 118 places, 72 transitions, 1051 flow. Second operand 25 states and 309 transitions. [2024-11-07 11:06:55,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 222 transitions, 3667 flow [2024-11-07 11:06:55,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 222 transitions, 3084 flow, removed 275 selfloop flow, removed 13 redundant places. [2024-11-07 11:06:55,701 INFO L231 Difference]: Finished difference. Result has 136 places, 83 transitions, 1339 flow [2024-11-07 11:06:55,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1339, PETRI_PLACES=136, PETRI_TRANSITIONS=83} [2024-11-07 11:06:55,701 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 110 predicate places. [2024-11-07 11:06:55,701 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 83 transitions, 1339 flow [2024-11-07 11:06:55,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:06:55,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:55,702 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:55,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 11:06:55,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:06:55,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:55,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2089657410, now seen corresponding path program 2 times [2024-11-07 11:06:55,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:55,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323167931] [2024-11-07 11:06:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:55,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:56,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323167931] [2024-11-07 11:06:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323167931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:06:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990829900] [2024-11-07 11:06:56,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 11:06:56,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:06:56,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:06:56,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:06:56,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 11:06:56,080 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 11:06:56,080 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 11:06:56,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 11:06:56,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:06:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:56,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:06:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:56,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990829900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 11:06:56,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 11:06:56,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-07 11:06:56,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498211872] [2024-11-07 11:06:56,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 11:06:56,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 11:06:56,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:56,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 11:06:56,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-07 11:06:56,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:56,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 83 transitions, 1339 flow. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:06:56,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:56,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:56,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:57,164 INFO L124 PetriNetUnfolderBase]: 1246/2377 cut-off events. [2024-11-07 11:06:57,165 INFO L125 PetriNetUnfolderBase]: For 139342/139348 co-relation queries the response was YES. [2024-11-07 11:06:57,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17840 conditions, 2377 events. 1246/2377 cut-off events. For 139342/139348 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12694 event pairs, 65 based on Foata normal form. 141/2515 useless extension candidates. Maximal degree in co-relation 17775. Up to 501 conditions per place. [2024-11-07 11:06:57,197 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 89 selfloop transitions, 78 changer transitions 98/268 dead transitions. [2024-11-07 11:06:57,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 268 transitions, 5207 flow [2024-11-07 11:06:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 11:06:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-07 11:06:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 345 transitions. [2024-11-07 11:06:57,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5133928571428571 [2024-11-07 11:06:57,202 INFO L175 Difference]: Start difference. First operand has 136 places, 83 transitions, 1339 flow. Second operand 28 states and 345 transitions. [2024-11-07 11:06:57,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 268 transitions, 5207 flow [2024-11-07 11:06:57,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 268 transitions, 4433 flow, removed 349 selfloop flow, removed 18 redundant places. [2024-11-07 11:06:57,343 INFO L231 Difference]: Finished difference. Result has 157 places, 104 transitions, 1968 flow [2024-11-07 11:06:57,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1968, PETRI_PLACES=157, PETRI_TRANSITIONS=104} [2024-11-07 11:06:57,344 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 131 predicate places. [2024-11-07 11:06:57,345 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 104 transitions, 1968 flow [2024-11-07 11:06:57,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:06:57,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:57,345 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:06:57,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 11:06:57,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 11:06:57,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:06:57,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:06:57,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1288511194, now seen corresponding path program 3 times [2024-11-07 11:06:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:06:57,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277667712] [2024-11-07 11:06:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:06:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:06:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:06:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:06:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277667712] [2024-11-07 11:06:57,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277667712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:06:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143889279] [2024-11-07 11:06:57,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 11:06:57,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:06:57,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:06:57,777 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:06:57,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 11:06:57,831 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-07 11:06:57,831 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 11:06:57,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 11:06:57,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:06:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:57,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:06:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:06:58,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143889279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 11:06:58,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 11:06:58,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2024-11-07 11:06:58,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538493297] [2024-11-07 11:06:58,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 11:06:58,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 11:06:58,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:06:58,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 11:06:58,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2024-11-07 11:06:58,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:06:58,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 104 transitions, 1968 flow. Second operand has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:06:58,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:06:58,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:06:58,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:06:59,738 INFO L124 PetriNetUnfolderBase]: 1714/3171 cut-off events. [2024-11-07 11:06:59,738 INFO L125 PetriNetUnfolderBase]: For 260934/260940 co-relation queries the response was YES. [2024-11-07 11:06:59,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27533 conditions, 3171 events. 1714/3171 cut-off events. For 260934/260940 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 15951 event pairs, 42 based on Foata normal form. 96/3266 useless extension candidates. Maximal degree in co-relation 27458. Up to 678 conditions per place. [2024-11-07 11:06:59,782 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 142 selfloop transitions, 114 changer transitions 135/394 dead transitions. [2024-11-07 11:06:59,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 394 transitions, 8418 flow [2024-11-07 11:06:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-07 11:06:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-07 11:06:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 565 transitions. [2024-11-07 11:06:59,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5117753623188406 [2024-11-07 11:06:59,785 INFO L175 Difference]: Start difference. First operand has 157 places, 104 transitions, 1968 flow. Second operand 46 states and 565 transitions. [2024-11-07 11:06:59,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 394 transitions, 8418 flow [2024-11-07 11:06:59,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 394 transitions, 7110 flow, removed 626 selfloop flow, removed 18 redundant places. [2024-11-07 11:06:59,986 INFO L231 Difference]: Finished difference. Result has 204 places, 138 transitions, 3070 flow [2024-11-07 11:06:59,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3070, PETRI_PLACES=204, PETRI_TRANSITIONS=138} [2024-11-07 11:06:59,987 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 178 predicate places. [2024-11-07 11:06:59,987 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 138 transitions, 3070 flow [2024-11-07 11:06:59,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:06:59,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:06:59,987 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:07:00,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 11:07:00,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 11:07:00,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:07:00,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:00,190 INFO L85 PathProgramCache]: Analyzing trace with hash 808533645, now seen corresponding path program 4 times [2024-11-07 11:07:00,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:00,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027557335] [2024-11-07 11:07:00,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:00,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027557335] [2024-11-07 11:07:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027557335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:07:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458375590] [2024-11-07 11:07:00,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 11:07:00,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:07:00,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:07:00,641 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:07:00,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 11:07:00,704 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 11:07:00,705 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 11:07:00,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 11:07:00,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:07:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:00,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:07:01,357 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:01,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458375590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 11:07:01,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 11:07:01,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-11-07 11:07:01,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009759664] [2024-11-07 11:07:01,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 11:07:01,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-07 11:07:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:01,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-07 11:07:01,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 11:07:01,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:07:01,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 138 transitions, 3070 flow. Second operand has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 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:07:01,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:01,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:07:01,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:03,257 INFO L124 PetriNetUnfolderBase]: 2218/4260 cut-off events. [2024-11-07 11:07:03,258 INFO L125 PetriNetUnfolderBase]: For 591333/591339 co-relation queries the response was YES. [2024-11-07 11:07:03,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45836 conditions, 4260 events. 2218/4260 cut-off events. For 591333/591339 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 22181 event pairs, 421 based on Foata normal form. 159/4416 useless extension candidates. Maximal degree in co-relation 45743. Up to 1483 conditions per place. [2024-11-07 11:07:03,297 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 190 selfloop transitions, 101 changer transitions 189/483 dead transitions. [2024-11-07 11:07:03,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 483 transitions, 13825 flow [2024-11-07 11:07:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-07 11:07:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2024-11-07 11:07:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 653 transitions. [2024-11-07 11:07:03,300 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4946969696969697 [2024-11-07 11:07:03,300 INFO L175 Difference]: Start difference. First operand has 204 places, 138 transitions, 3070 flow. Second operand 55 states and 653 transitions. [2024-11-07 11:07:03,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 483 transitions, 13825 flow [2024-11-07 11:07:03,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 483 transitions, 10115 flow, removed 1813 selfloop flow, removed 29 redundant places. [2024-11-07 11:07:03,902 INFO L231 Difference]: Finished difference. Result has 252 places, 180 transitions, 3968 flow [2024-11-07 11:07:03,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=3968, PETRI_PLACES=252, PETRI_TRANSITIONS=180} [2024-11-07 11:07:03,904 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 226 predicate places. [2024-11-07 11:07:03,904 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 180 transitions, 3968 flow [2024-11-07 11:07:03,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 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:07:03,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:03,904 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:07:03,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 11:07:04,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 11:07:04,105 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:07:04,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1802871663, now seen corresponding path program 5 times [2024-11-07 11:07:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302867964] [2024-11-07 11:07:04,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302867964] [2024-11-07 11:07:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302867964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:07:04,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289938816] [2024-11-07 11:07:04,432 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 11:07:04,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:07:04,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:07:04,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:07:04,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 11:07:04,497 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-07 11:07:04,497 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 11:07:04,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 11:07:04,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:07:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:04,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:07:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:05,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289938816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 11:07:05,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 11:07:05,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2024-11-07 11:07:05,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20280131] [2024-11-07 11:07:05,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 11:07:05,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-07 11:07:05,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:05,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-07 11:07:05,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 11:07:05,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:07:05,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 180 transitions, 3968 flow. Second operand has 36 states, 36 states have (on average 7.083333333333333) internal successors, (255), 36 states have internal predecessors, (255), 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:07:05,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:05,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:07:05,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:07,411 INFO L124 PetriNetUnfolderBase]: 2767/5513 cut-off events. [2024-11-07 11:07:07,411 INFO L125 PetriNetUnfolderBase]: For 986804/986810 co-relation queries the response was YES. [2024-11-07 11:07:07,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61509 conditions, 5513 events. 2767/5513 cut-off events. For 986804/986810 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 31176 event pairs, 194 based on Foata normal form. 159/5671 useless extension candidates. Maximal degree in co-relation 61401. Up to 1380 conditions per place. [2024-11-07 11:07:07,484 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 180 selfloop transitions, 193 changer transitions 201/577 dead transitions. [2024-11-07 11:07:07,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 577 transitions, 16558 flow [2024-11-07 11:07:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-07 11:07:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2024-11-07 11:07:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 730 transitions. [2024-11-07 11:07:07,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49863387978142076 [2024-11-07 11:07:07,492 INFO L175 Difference]: Start difference. First operand has 252 places, 180 transitions, 3968 flow. Second operand 61 states and 730 transitions. [2024-11-07 11:07:07,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 577 transitions, 16558 flow [2024-11-07 11:07:08,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 577 transitions, 14028 flow, removed 1228 selfloop flow, removed 31 redundant places. [2024-11-07 11:07:08,849 INFO L231 Difference]: Finished difference. Result has 300 places, 241 transitions, 5993 flow [2024-11-07 11:07:08,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3066, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=5993, PETRI_PLACES=300, PETRI_TRANSITIONS=241} [2024-11-07 11:07:08,850 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 274 predicate places. [2024-11-07 11:07:08,850 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 241 transitions, 5993 flow [2024-11-07 11:07:08,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.083333333333333) internal successors, (255), 36 states have internal predecessors, (255), 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:07:08,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:08,851 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:07:08,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 11:07:09,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:07:09,051 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:07:09,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1402905997, now seen corresponding path program 6 times [2024-11-07 11:07:09,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:09,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521506818] [2024-11-07 11:07:09,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:09,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:09,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:09,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521506818] [2024-11-07 11:07:09,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521506818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:07:09,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830583999] [2024-11-07 11:07:09,327 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-07 11:07:09,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:07:09,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:07:09,330 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:07:09,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 11:07:09,397 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-07 11:07:09,397 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 11:07:09,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 11:07:09,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:07:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:09,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:07:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:09,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830583999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 11:07:09,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 11:07:09,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-11-07 11:07:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139971992] [2024-11-07 11:07:09,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 11:07:09,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-07 11:07:09,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:09,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-07 11:07:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 11:07:09,868 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:07:09,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 241 transitions, 5993 flow. Second operand has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 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:07:09,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:09,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:07:09,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:13,001 INFO L124 PetriNetUnfolderBase]: 3694/7306 cut-off events. [2024-11-07 11:07:13,002 INFO L125 PetriNetUnfolderBase]: For 1943350/1943356 co-relation queries the response was YES. [2024-11-07 11:07:13,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95685 conditions, 7306 events. 3694/7306 cut-off events. For 1943350/1943356 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 42688 event pairs, 83 based on Foata normal form. 159/7462 useless extension candidates. Maximal degree in co-relation 95559. Up to 1827 conditions per place. [2024-11-07 11:07:13,133 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 226 selfloop transitions, 274 changer transitions 205/708 dead transitions. [2024-11-07 11:07:13,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 708 transitions, 23649 flow [2024-11-07 11:07:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-07 11:07:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-11-07 11:07:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 868 transitions. [2024-11-07 11:07:13,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5093896713615024 [2024-11-07 11:07:13,139 INFO L175 Difference]: Start difference. First operand has 300 places, 241 transitions, 5993 flow. Second operand 71 states and 868 transitions. [2024-11-07 11:07:13,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 708 transitions, 23649 flow [2024-11-07 11:07:15,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 708 transitions, 19791 flow, removed 1881 selfloop flow, removed 31 redundant places. [2024-11-07 11:07:15,537 INFO L231 Difference]: Finished difference. Result has 364 places, 302 transitions, 8507 flow [2024-11-07 11:07:15,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4531, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=8507, PETRI_PLACES=364, PETRI_TRANSITIONS=302} [2024-11-07 11:07:15,538 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 338 predicate places. [2024-11-07 11:07:15,538 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 302 transitions, 8507 flow [2024-11-07 11:07:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 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:07:15,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:15,539 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:07:15,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 11:07:15,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:07:15,739 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:07:15,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:15,740 INFO L85 PathProgramCache]: Analyzing trace with hash 608057671, now seen corresponding path program 7 times [2024-11-07 11:07:15,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:15,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432332280] [2024-11-07 11:07:15,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:15,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:16,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:16,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432332280] [2024-11-07 11:07:16,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432332280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:07:16,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017043333] [2024-11-07 11:07:16,259 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-07 11:07:16,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:07:16,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:07:16,262 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:07:16,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 11:07:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:16,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 11:07:16,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:07:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:16,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:07:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017043333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 11:07:16,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 11:07:16,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2024-11-07 11:07:16,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780503132] [2024-11-07 11:07:16,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 11:07:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-07 11:07:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-07 11:07:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1596, Unknown=0, NotChecked=0, Total=2070 [2024-11-07 11:07:16,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:07:16,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 302 transitions, 8507 flow. Second operand has 46 states, 46 states have (on average 7.021739130434782) internal successors, (323), 46 states have internal predecessors, (323), 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:07:16,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:16,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:07:16,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:22,104 INFO L124 PetriNetUnfolderBase]: 5170/10176 cut-off events. [2024-11-07 11:07:22,104 INFO L125 PetriNetUnfolderBase]: For 4206680/4206686 co-relation queries the response was YES. [2024-11-07 11:07:22,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160013 conditions, 10176 events. 5170/10176 cut-off events. For 4206680/4206686 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 59567 event pairs, 52 based on Foata normal form. 330/10505 useless extension candidates. Maximal degree in co-relation 159862. Up to 2574 conditions per place. [2024-11-07 11:07:22,256 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 314 selfloop transitions, 388 changer transitions 335/1040 dead transitions. [2024-11-07 11:07:22,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1040 transitions, 42789 flow [2024-11-07 11:07:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-11-07 11:07:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2024-11-07 11:07:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 1297 transitions. [2024-11-07 11:07:22,259 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5098270440251572 [2024-11-07 11:07:22,259 INFO L175 Difference]: Start difference. First operand has 364 places, 302 transitions, 8507 flow. Second operand 106 states and 1297 transitions. [2024-11-07 11:07:22,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1040 transitions, 42789 flow [2024-11-07 11:07:26,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1040 transitions, 34190 flow, removed 4215 selfloop flow, removed 35 redundant places. [2024-11-07 11:07:26,515 INFO L231 Difference]: Finished difference. Result has 482 places, 416 transitions, 13694 flow [2024-11-07 11:07:26,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6124, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=13694, PETRI_PLACES=482, PETRI_TRANSITIONS=416} [2024-11-07 11:07:26,516 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 456 predicate places. [2024-11-07 11:07:26,516 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 416 transitions, 13694 flow [2024-11-07 11:07:26,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 7.021739130434782) internal successors, (323), 46 states have internal predecessors, (323), 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:07:26,517 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:26,517 INFO L204 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:07:26,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-07 11:07:26,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:07:26,719 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:07:26,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash -494474371, now seen corresponding path program 8 times [2024-11-07 11:07:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:26,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510623127] [2024-11-07 11:07:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:27,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510623127] [2024-11-07 11:07:27,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510623127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:07:27,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664834862] [2024-11-07 11:07:27,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 11:07:27,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:07:27,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:07:27,512 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:07:27,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-07 11:07:27,584 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 11:07:27,584 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 11:07:27,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-07 11:07:27,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:07:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:27,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:07:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:07:28,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664834862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 11:07:28,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 11:07:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 46 [2024-11-07 11:07:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777226956] [2024-11-07 11:07:28,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 11:07:28,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-07 11:07:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:28,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-07 11:07:28,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 11:07:28,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-07 11:07:28,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 416 transitions, 13694 flow. Second operand has 47 states, 47 states have (on average 7.085106382978723) internal successors, (333), 47 states have internal predecessors, (333), 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:07:28,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:28,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-07 11:07:28,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:34,971 INFO L124 PetriNetUnfolderBase]: 5692/11178 cut-off events. [2024-11-07 11:07:34,971 INFO L125 PetriNetUnfolderBase]: For 6361445/6361451 co-relation queries the response was YES. [2024-11-07 11:07:35,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186456 conditions, 11178 events. 5692/11178 cut-off events. For 6361445/6361451 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 65224 event pairs, 38 based on Foata normal form. 42/11219 useless extension candidates. Maximal degree in co-relation 186258. Up to 2661 conditions per place. [2024-11-07 11:07:35,353 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 311 selfloop transitions, 456 changer transitions 185/955 dead transitions. [2024-11-07 11:07:35,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 955 transitions, 38315 flow [2024-11-07 11:07:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-11-07 11:07:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2024-11-07 11:07:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 1039 transitions. [2024-11-07 11:07:35,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5033914728682171 [2024-11-07 11:07:35,355 INFO L175 Difference]: Start difference. First operand has 482 places, 416 transitions, 13694 flow. Second operand 86 states and 1039 transitions. [2024-11-07 11:07:35,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 955 transitions, 38315 flow [2024-11-07 11:07:50,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 955 transitions, 27969 flow, removed 5029 selfloop flow, removed 53 redundant places. [2024-11-07 11:07:50,208 INFO L231 Difference]: Finished difference. Result has 503 places, 488 transitions, 11953 flow [2024-11-07 11:07:50,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=8773, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=385, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=11953, PETRI_PLACES=503, PETRI_TRANSITIONS=488} [2024-11-07 11:07:50,210 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 477 predicate places. [2024-11-07 11:07:50,210 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 488 transitions, 11953 flow [2024-11-07 11:07:50,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 7.085106382978723) internal successors, (333), 47 states have internal predecessors, (333), 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:07:50,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:50,211 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:07:50,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-07 11:07:50,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 11:07:50,411 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-07 11:07:50,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1945280818, now seen corresponding path program 9 times [2024-11-07 11:07:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955832132] [2024-11-07 11:07:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:07:50,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:07:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:07:50,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:07:50,512 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:07:50,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-07 11:07:50,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-07 11:07:50,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-07 11:07:50,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 11:07:50,516 INFO L407 BasicCegarLoop]: Path program histogram: [9, 3, 2, 2, 1] [2024-11-07 11:07:50,679 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:07:50,679 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:07:50,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:07:50 BasicIcfg [2024-11-07 11:07:50,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:07:50,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:07:50,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:07:50,688 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:07:50,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:06:48" (3/4) ... [2024-11-07 11:07:50,690 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 11:07:50,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:07:50,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:07:50,855 INFO L158 Benchmark]: Toolchain (without parser) took 63164.37ms. Allocated memory was 109.1MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 84.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-07 11:07:50,856 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:07:50,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.76ms. Allocated memory is still 109.1MB. Free memory was 83.9MB in the beginning and 64.4MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 11:07:50,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.24ms. Allocated memory is still 109.1MB. Free memory was 64.3MB in the beginning and 62.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:07:50,857 INFO L158 Benchmark]: Boogie Preprocessor took 50.18ms. Allocated memory is still 109.1MB. Free memory was 62.8MB in the beginning and 61.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:07:50,858 INFO L158 Benchmark]: RCFGBuilder took 396.04ms. Allocated memory is still 109.1MB. Free memory was 61.3MB in the beginning and 45.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 11:07:50,858 INFO L158 Benchmark]: TraceAbstraction took 62097.85ms. Allocated memory was 109.1MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 44.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-11-07 11:07:50,859 INFO L158 Benchmark]: Witness Printer took 166.21ms. Allocated memory is still 3.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 11:07:50,860 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.19ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.76ms. Allocated memory is still 109.1MB. Free memory was 83.9MB in the beginning and 64.4MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.24ms. Allocated memory is still 109.1MB. Free memory was 64.3MB in the beginning and 62.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.18ms. Allocated memory is still 109.1MB. Free memory was 62.8MB in the beginning and 61.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 396.04ms. Allocated memory is still 109.1MB. Free memory was 61.3MB in the beginning and 45.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 62097.85ms. Allocated memory was 109.1MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 44.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 166.21ms. Allocated memory is still 3.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-2, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=3, id1=-2, id2=-1, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=43, id1=-2, id2=-1, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=19, k=19] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=19, k=19] - UnprovableResult [Line: 713]: 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: 714]: 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 5 procedures, 34 locations, 3 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: 61.8s, OverallIterations: 17, TraceHistogramMax: 20, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 50.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7991 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7956 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 311 mSDsCounter, 415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7846 IncrementalHoareTripleChecker+Invalid, 8261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 415 mSolverCounterUnsat, 19 mSDtfsCounter, 7846 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1567 GetRequests, 753 SyntacticMatches, 35 SemanticMatches, 779 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22358 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13694occurred in iteration=15, InterpolantAutomatonStates: 578, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1107 NumberOfCodeBlocks, 1107 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1392 ConstructedInterpolants, 0 QuantifiedInterpolants, 5633 SizeOfPredicates, 130 NumberOfNonLiveVariables, 1340 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 0/4641 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:07:50,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE