./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '9d6df98e8ac4880739ff8c7fa9cf00b32c56a4c64770b2bc9bcfef3d013872fa'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d6df98e8ac4880739ff8c7fa9cf00b32c56a4c64770b2bc9bcfef3d013872fa --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:13:18,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:13:18,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:13:18,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:13:18,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:13:18,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:13:18,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:13:18,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:13:18,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:13:18,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:13:18,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:13:18,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:13:18,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:13:18,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:13:18,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:13:18,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:13:18,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:13:18,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:13:18,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:13:18,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:13:18,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:13:18,536 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 -> 9d6df98e8ac4880739ff8c7fa9cf00b32c56a4c64770b2bc9bcfef3d013872fa [2024-11-07 11:13:18,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:13:18,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:13:18,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:13:18,789 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:13:18,789 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:13:18,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 11:13:19,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:13:20,213 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:13:20,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 11:13:20,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7133496db/799b825663254b0b8c0a45d5f4fb0867/FLAG5aaccd62d [2024-11-07 11:13:20,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7133496db/799b825663254b0b8c0a45d5f4fb0867 [2024-11-07 11:13:20,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:13:20,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:13:20,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:13:20,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:13:20,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:13:20,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4b55cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20, skipping insertion in model container [2024-11-07 11:13:20,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:13:20,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2024-11-07 11:13:20,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:13:20,546 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:13:20,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2024-11-07 11:13:20,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:13:20,662 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:13:20,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20 WrapperNode [2024-11-07 11:13:20,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:13:20,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:13:20,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:13:20,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:13:20,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,710 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2024-11-07 11:13:20,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:13:20,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:13:20,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:13:20,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:13:20,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,741 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 11:13:20,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:13:20,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:13:20,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:13:20,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:13:20,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (1/1) ... [2024-11-07 11:13:20,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:13:20,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:13:20,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 11:13:20,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 11:13:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 11:13:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:13:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 11:13:20,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 11:13:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 11:13:20,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 11:13:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:13:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 11:13:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:13:20,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:13:20,825 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 11:13:20,939 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:13:20,940 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:13:21,272 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:13:21,273 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:13:21,506 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:13:21,507 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 11:13:21,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:13:21 BoogieIcfgContainer [2024-11-07 11:13:21,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:13:21,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:13:21,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:13:21,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:13:21,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:13:20" (1/3) ... [2024-11-07 11:13:21,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dec2a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:13:21, skipping insertion in model container [2024-11-07 11:13:21,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:13:20" (2/3) ... [2024-11-07 11:13:21,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dec2a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:13:21, skipping insertion in model container [2024-11-07 11:13:21,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:13:21" (3/3) ... [2024-11-07 11:13:21,517 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-07 11:13:21,529 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:13:21,530 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 11:13:21,530 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:13:21,580 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:13:21,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 74 flow [2024-11-07 11:13:21,636 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2024-11-07 11:13:21,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:13:21,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-07 11:13:21,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 74 flow [2024-11-07 11:13:21,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 68 flow [2024-11-07 11:13:21,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:13:21,662 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;@5619a25b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:13:21,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-07 11:13:21,667 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:13:21,667 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-11-07 11:13:21,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:13:21,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:21,668 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 11:13:21,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:21,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:21,672 INFO L85 PathProgramCache]: Analyzing trace with hash -942372534, now seen corresponding path program 1 times [2024-11-07 11:13:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:21,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404376000] [2024-11-07 11:13:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:21,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:22,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404376000] [2024-11-07 11:13:22,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404376000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:22,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:22,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 11:13:22,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104453054] [2024-11-07 11:13:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:22,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:13:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:22,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:13:22,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:13:22,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2024-11-07 11:13:22,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:22,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:22,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2024-11-07 11:13:22,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:22,365 INFO L124 PetriNetUnfolderBase]: 264/581 cut-off events. [2024-11-07 11:13:22,366 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 11:13:22,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 581 events. 264/581 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3134 event pairs, 32 based on Foata normal form. 25/599 useless extension candidates. Maximal degree in co-relation 1037. Up to 373 conditions per place. [2024-11-07 11:13:22,378 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 24 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2024-11-07 11:13:22,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 140 flow [2024-11-07 11:13:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:13:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 11:13:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-11-07 11:13:22,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2024-11-07 11:13:22,394 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 70 transitions. [2024-11-07 11:13:22,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 140 flow [2024-11-07 11:13:22,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:13:22,401 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-11-07 11:13:22,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-07 11:13:22,407 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2024-11-07 11:13:22,408 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-11-07 11:13:22,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:22,408 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:22,408 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:22,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:13:22,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash 725790871, now seen corresponding path program 1 times [2024-11-07 11:13:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984198689] [2024-11-07 11:13:22,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:22,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984198689] [2024-11-07 11:13:22,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984198689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:22,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:22,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:13:22,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521129133] [2024-11-07 11:13:22,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:22,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:13:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:22,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:13:22,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:13:22,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-07 11:13:22,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:22,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:22,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-07 11:13:22,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:23,066 INFO L124 PetriNetUnfolderBase]: 426/800 cut-off events. [2024-11-07 11:13:23,067 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-07 11:13:23,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 800 events. 426/800 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4189 event pairs, 96 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1568. Up to 358 conditions per place. [2024-11-07 11:13:23,074 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 24 selfloop transitions, 2 changer transitions 39/73 dead transitions. [2024-11-07 11:13:23,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 73 transitions, 288 flow [2024-11-07 11:13:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:13:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:13:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-11-07 11:13:23,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5568181818181818 [2024-11-07 11:13:23,077 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 8 states and 147 transitions. [2024-11-07 11:13:23,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 73 transitions, 288 flow [2024-11-07 11:13:23,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 73 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:13:23,081 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 74 flow [2024-11-07 11:13:23,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2024-11-07 11:13:23,082 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2024-11-07 11:13:23,083 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 74 flow [2024-11-07 11:13:23,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:23,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:23,083 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:23,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:13:23,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:23,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1338166714, now seen corresponding path program 1 times [2024-11-07 11:13:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659615755] [2024-11-07 11:13:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659615755] [2024-11-07 11:13:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659615755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:23,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:23,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:13:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93784794] [2024-11-07 11:13:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:23,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:13:23,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:23,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:13:23,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:13:23,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-11-07 11:13:23,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:23,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:23,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-11-07 11:13:23,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:23,570 INFO L124 PetriNetUnfolderBase]: 245/496 cut-off events. [2024-11-07 11:13:23,571 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-07 11:13:23,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 496 events. 245/496 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2469 event pairs, 69 based on Foata normal form. 20/511 useless extension candidates. Maximal degree in co-relation 1046. Up to 253 conditions per place. [2024-11-07 11:13:23,574 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 25 selfloop transitions, 2 changer transitions 23/59 dead transitions. [2024-11-07 11:13:23,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 250 flow [2024-11-07 11:13:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:13:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 11:13:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-11-07 11:13:23,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2024-11-07 11:13:23,582 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 74 flow. Second operand 7 states and 129 transitions. [2024-11-07 11:13:23,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 250 flow [2024-11-07 11:13:23,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 59 transitions, 230 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-07 11:13:23,588 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 78 flow [2024-11-07 11:13:23,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2024-11-07 11:13:23,589 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2024-11-07 11:13:23,590 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 78 flow [2024-11-07 11:13:23,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:23,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:23,590 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:23,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:13:23,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:23,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1356102712, now seen corresponding path program 1 times [2024-11-07 11:13:23,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:23,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275172659] [2024-11-07 11:13:23,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:23,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:24,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275172659] [2024-11-07 11:13:24,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275172659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:24,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:24,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:13:24,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268823555] [2024-11-07 11:13:24,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:24,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:13:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:13:24,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:13:24,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-11-07 11:13:24,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 78 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:24,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:24,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-11-07 11:13:24,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:25,355 INFO L124 PetriNetUnfolderBase]: 559/1030 cut-off events. [2024-11-07 11:13:25,356 INFO L125 PetriNetUnfolderBase]: For 304/305 co-relation queries the response was YES. [2024-11-07 11:13:25,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2336 conditions, 1030 events. 559/1030 cut-off events. For 304/305 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5102 event pairs, 87 based on Foata normal form. 23/1052 useless extension candidates. Maximal degree in co-relation 2320. Up to 587 conditions per place. [2024-11-07 11:13:25,362 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 62 selfloop transitions, 25 changer transitions 29/122 dead transitions. [2024-11-07 11:13:25,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 122 transitions, 569 flow [2024-11-07 11:13:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 11:13:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-07 11:13:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 247 transitions. [2024-11-07 11:13:25,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4678030303030303 [2024-11-07 11:13:25,364 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 78 flow. Second operand 16 states and 247 transitions. [2024-11-07 11:13:25,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 122 transitions, 569 flow [2024-11-07 11:13:25,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 122 transitions, 515 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-11-07 11:13:25,371 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 243 flow [2024-11-07 11:13:25,371 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=243, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2024-11-07 11:13:25,373 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2024-11-07 11:13:25,374 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 243 flow [2024-11-07 11:13:25,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:25,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:25,375 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:25,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:13:25,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:25,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1195211688, now seen corresponding path program 2 times [2024-11-07 11:13:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:25,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248602917] [2024-11-07 11:13:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:25,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:26,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:26,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248602917] [2024-11-07 11:13:26,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248602917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:26,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:26,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:13:26,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625045248] [2024-11-07 11:13:26,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:26,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:13:26,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:26,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:13:26,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:13:26,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-07 11:13:26,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 243 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:26,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:26,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-07 11:13:26,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:27,075 INFO L124 PetriNetUnfolderBase]: 423/867 cut-off events. [2024-11-07 11:13:27,076 INFO L125 PetriNetUnfolderBase]: For 969/997 co-relation queries the response was YES. [2024-11-07 11:13:27,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 867 events. 423/867 cut-off events. For 969/997 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4709 event pairs, 71 based on Foata normal form. 19/884 useless extension candidates. Maximal degree in co-relation 2643. Up to 604 conditions per place. [2024-11-07 11:13:27,082 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 50 selfloop transitions, 14 changer transitions 21/95 dead transitions. [2024-11-07 11:13:27,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 95 transitions, 606 flow [2024-11-07 11:13:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:13:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 11:13:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-11-07 11:13:27,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2024-11-07 11:13:27,084 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 243 flow. Second operand 9 states and 150 transitions. [2024-11-07 11:13:27,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 95 transitions, 606 flow [2024-11-07 11:13:27,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 95 transitions, 582 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-11-07 11:13:27,090 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 351 flow [2024-11-07 11:13:27,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=351, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2024-11-07 11:13:27,091 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2024-11-07 11:13:27,091 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 351 flow [2024-11-07 11:13:27,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:27,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:27,091 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:27,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:13:27,092 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:27,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1439322592, now seen corresponding path program 3 times [2024-11-07 11:13:27,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:27,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290258177] [2024-11-07 11:13:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:27,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:27,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:27,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290258177] [2024-11-07 11:13:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290258177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:27,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:13:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045754946] [2024-11-07 11:13:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:27,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:13:27,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:27,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:13:27,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:13:27,899 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-07 11:13:27,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 351 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:27,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:27,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-07 11:13:27,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:28,345 INFO L124 PetriNetUnfolderBase]: 426/882 cut-off events. [2024-11-07 11:13:28,345 INFO L125 PetriNetUnfolderBase]: For 1352/1389 co-relation queries the response was YES. [2024-11-07 11:13:28,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 882 events. 426/882 cut-off events. For 1352/1389 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4834 event pairs, 37 based on Foata normal form. 57/938 useless extension candidates. Maximal degree in co-relation 2857. Up to 520 conditions per place. [2024-11-07 11:13:28,352 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 51 selfloop transitions, 26 changer transitions 27/114 dead transitions. [2024-11-07 11:13:28,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 114 transitions, 821 flow [2024-11-07 11:13:28,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 11:13:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 11:13:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-11-07 11:13:28,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5013774104683195 [2024-11-07 11:13:28,353 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 351 flow. Second operand 11 states and 182 transitions. [2024-11-07 11:13:28,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 114 transitions, 821 flow [2024-11-07 11:13:28,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 114 transitions, 782 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-11-07 11:13:28,359 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 467 flow [2024-11-07 11:13:28,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=467, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2024-11-07 11:13:28,361 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 35 predicate places. [2024-11-07 11:13:28,361 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 467 flow [2024-11-07 11:13:28,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:28,361 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:28,362 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:28,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:13:28,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:28,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:28,362 INFO L85 PathProgramCache]: Analyzing trace with hash 682971266, now seen corresponding path program 4 times [2024-11-07 11:13:28,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:28,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424727384] [2024-11-07 11:13:28,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:28,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:28,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:28,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424727384] [2024-11-07 11:13:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424727384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:28,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:28,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:13:28,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749785409] [2024-11-07 11:13:28,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:28,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:13:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:28,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:13:28,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:13:28,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-07 11:13:28,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 467 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:28,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:28,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-07 11:13:28,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:28,666 INFO L124 PetriNetUnfolderBase]: 388/762 cut-off events. [2024-11-07 11:13:28,666 INFO L125 PetriNetUnfolderBase]: For 1497/1541 co-relation queries the response was YES. [2024-11-07 11:13:28,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2577 conditions, 762 events. 388/762 cut-off events. For 1497/1541 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3721 event pairs, 81 based on Foata normal form. 71/822 useless extension candidates. Maximal degree in co-relation 2546. Up to 289 conditions per place. [2024-11-07 11:13:28,672 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 69 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2024-11-07 11:13:28,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 663 flow [2024-11-07 11:13:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:13:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:13:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-11-07 11:13:28,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-07 11:13:28,673 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 467 flow. Second operand 4 states and 84 transitions. [2024-11-07 11:13:28,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 663 flow [2024-11-07 11:13:28,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 622 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-11-07 11:13:28,680 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 384 flow [2024-11-07 11:13:28,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=384, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-11-07 11:13:28,682 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2024-11-07 11:13:28,682 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 384 flow [2024-11-07 11:13:28,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:28,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:28,682 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:28,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:13:28,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:28,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash 979206463, now seen corresponding path program 1 times [2024-11-07 11:13:28,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:28,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022751115] [2024-11-07 11:13:28,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:28,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022751115] [2024-11-07 11:13:28,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022751115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:28,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:28,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:13:28,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047567134] [2024-11-07 11:13:28,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:28,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:13:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:28,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:13:28,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:13:28,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-07 11:13:28,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 384 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:28,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:28,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-07 11:13:28,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:29,051 INFO L124 PetriNetUnfolderBase]: 275/555 cut-off events. [2024-11-07 11:13:29,051 INFO L125 PetriNetUnfolderBase]: For 992/1031 co-relation queries the response was YES. [2024-11-07 11:13:29,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 555 events. 275/555 cut-off events. For 992/1031 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2569 event pairs, 96 based on Foata normal form. 40/582 useless extension candidates. Maximal degree in co-relation 1911. Up to 228 conditions per place. [2024-11-07 11:13:29,055 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 58 selfloop transitions, 8 changer transitions 0/76 dead transitions. [2024-11-07 11:13:29,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 76 transitions, 573 flow [2024-11-07 11:13:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:13:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:13:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-11-07 11:13:29,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-11-07 11:13:29,057 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 384 flow. Second operand 5 states and 90 transitions. [2024-11-07 11:13:29,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 76 transitions, 573 flow [2024-11-07 11:13:29,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 534 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-07 11:13:29,063 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 381 flow [2024-11-07 11:13:29,064 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-11-07 11:13:29,065 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 28 predicate places. [2024-11-07 11:13:29,065 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 381 flow [2024-11-07 11:13:29,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:29,066 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:29,066 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:29,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:13:29,067 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:29,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:29,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1073645308, now seen corresponding path program 1 times [2024-11-07 11:13:29,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:29,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625934849] [2024-11-07 11:13:29,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:29,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:29,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625934849] [2024-11-07 11:13:29,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625934849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:29,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:29,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:13:29,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822972831] [2024-11-07 11:13:29,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:29,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:13:29,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:29,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:13:29,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:13:29,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-07 11:13:29,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 381 flow. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:29,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:29,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-07 11:13:29,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:29,855 INFO L124 PetriNetUnfolderBase]: 218/525 cut-off events. [2024-11-07 11:13:29,856 INFO L125 PetriNetUnfolderBase]: For 886/919 co-relation queries the response was YES. [2024-11-07 11:13:29,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1642 conditions, 525 events. 218/525 cut-off events. For 886/919 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2673 event pairs, 34 based on Foata normal form. 22/517 useless extension candidates. Maximal degree in co-relation 1615. Up to 170 conditions per place. [2024-11-07 11:13:29,858 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 29 selfloop transitions, 8 changer transitions 36/85 dead transitions. [2024-11-07 11:13:29,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 596 flow [2024-11-07 11:13:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:13:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:13:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-11-07 11:13:29,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2024-11-07 11:13:29,860 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 381 flow. Second operand 8 states and 131 transitions. [2024-11-07 11:13:29,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 596 flow [2024-11-07 11:13:29,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 575 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-11-07 11:13:29,863 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 250 flow [2024-11-07 11:13:29,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=250, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2024-11-07 11:13:29,864 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 35 predicate places. [2024-11-07 11:13:29,864 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 250 flow [2024-11-07 11:13:29,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:29,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:29,864 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:29,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 11:13:29,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:29,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:29,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1711350898, now seen corresponding path program 2 times [2024-11-07 11:13:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:29,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187659085] [2024-11-07 11:13:29,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:29,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:30,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187659085] [2024-11-07 11:13:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187659085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:30,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:30,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:13:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293222760] [2024-11-07 11:13:30,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:30,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:13:30,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:30,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:13:30,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:13:30,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-07 11:13:30,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:30,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:30,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-07 11:13:30,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:30,526 INFO L124 PetriNetUnfolderBase]: 129/341 cut-off events. [2024-11-07 11:13:30,526 INFO L125 PetriNetUnfolderBase]: For 383/419 co-relation queries the response was YES. [2024-11-07 11:13:30,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 341 events. 129/341 cut-off events. For 383/419 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1523 event pairs, 52 based on Foata normal form. 14/333 useless extension candidates. Maximal degree in co-relation 971. Up to 114 conditions per place. [2024-11-07 11:13:30,527 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 20 selfloop transitions, 6 changer transitions 26/64 dead transitions. [2024-11-07 11:13:30,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 414 flow [2024-11-07 11:13:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:13:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:13:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-11-07 11:13:30,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-07 11:13:30,529 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 250 flow. Second operand 8 states and 128 transitions. [2024-11-07 11:13:30,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 414 flow [2024-11-07 11:13:30,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 344 flow, removed 9 selfloop flow, removed 16 redundant places. [2024-11-07 11:13:30,533 INFO L231 Difference]: Finished difference. Result has 63 places, 36 transitions, 170 flow [2024-11-07 11:13:30,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=170, PETRI_PLACES=63, PETRI_TRANSITIONS=36} [2024-11-07 11:13:30,534 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2024-11-07 11:13:30,534 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 36 transitions, 170 flow [2024-11-07 11:13:30,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:30,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:13:30,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:13:30,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 11:13:30,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:13:30,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:13:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash -306347820, now seen corresponding path program 3 times [2024-11-07 11:13:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:13:30,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659877697] [2024-11-07 11:13:30,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:13:30,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:13:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:13:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:13:31,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:13:31,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659877697] [2024-11-07 11:13:31,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659877697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:13:31,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:13:31,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:13:31,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073315363] [2024-11-07 11:13:31,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:13:31,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:13:31,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:13:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:13:31,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:13:31,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-07 11:13:31,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 36 transitions, 170 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:31,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:13:31,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-07 11:13:31,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:13:31,548 INFO L124 PetriNetUnfolderBase]: 55/158 cut-off events. [2024-11-07 11:13:31,549 INFO L125 PetriNetUnfolderBase]: For 94/110 co-relation queries the response was YES. [2024-11-07 11:13:31,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 158 events. 55/158 cut-off events. For 94/110 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 514 event pairs, 10 based on Foata normal form. 6/154 useless extension candidates. Maximal degree in co-relation 428. Up to 44 conditions per place. [2024-11-07 11:13:31,549 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2024-11-07 11:13:31,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 43 transitions, 246 flow [2024-11-07 11:13:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:13:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:13:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-11-07 11:13:31,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-11-07 11:13:31,551 INFO L175 Difference]: Start difference. First operand has 63 places, 36 transitions, 170 flow. Second operand 8 states and 110 transitions. [2024-11-07 11:13:31,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 43 transitions, 246 flow [2024-11-07 11:13:31,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 218 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-07 11:13:31,552 INFO L231 Difference]: Finished difference. Result has 54 places, 0 transitions, 0 flow [2024-11-07 11:13:31,552 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=54, PETRI_TRANSITIONS=0} [2024-11-07 11:13:31,552 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-11-07 11:13:31,552 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 0 transitions, 0 flow [2024-11-07 11:13:31,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:13:31,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-07 11:13:31,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-07 11:13:31,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-07 11:13:31,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-07 11:13:31,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-07 11:13:31,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 11:13:31,556 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2024-11-07 11:13:31,560 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:13:31,560 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:13:31,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:13:31 BasicIcfg [2024-11-07 11:13:31,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:13:31,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:13:31,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:13:31,567 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:13:31,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:13:21" (3/4) ... [2024-11-07 11:13:31,569 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 11:13:31,572 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2024-11-07 11:13:31,572 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2024-11-07 11:13:31,576 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 75 nodes and edges [2024-11-07 11:13:31,576 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-07 11:13:31,577 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 11:13:31,577 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 11:13:31,639 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:13:31,639 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 11:13:31,639 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:13:31,641 INFO L158 Benchmark]: Toolchain (without parser) took 11393.71ms. Allocated memory was 117.4MB in the beginning and 461.4MB in the end (delta: 343.9MB). Free memory was 89.6MB in the beginning and 342.7MB in the end (delta: -253.1MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2024-11-07 11:13:31,641 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:13:31,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.45ms. Allocated memory is still 117.4MB. Free memory was 89.4MB in the beginning and 64.0MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 11:13:31,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.98ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 61.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:13:31,642 INFO L158 Benchmark]: Boogie Preprocessor took 55.57ms. Allocated memory is still 117.4MB. Free memory was 61.2MB in the beginning and 57.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:13:31,642 INFO L158 Benchmark]: RCFGBuilder took 740.11ms. Allocated memory is still 117.4MB. Free memory was 57.1MB in the beginning and 83.1MB in the end (delta: -26.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-07 11:13:31,642 INFO L158 Benchmark]: TraceAbstraction took 10056.61ms. Allocated memory was 117.4MB in the beginning and 461.4MB in the end (delta: 343.9MB). Free memory was 82.5MB in the beginning and 346.8MB in the end (delta: -264.3MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. [2024-11-07 11:13:31,642 INFO L158 Benchmark]: Witness Printer took 72.21ms. Allocated memory is still 461.4MB. Free memory was 346.8MB in the beginning and 342.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:13:31,643 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.25ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.45ms. Allocated memory is still 117.4MB. Free memory was 89.4MB in the beginning and 64.0MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.98ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 61.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.57ms. Allocated memory is still 117.4MB. Free memory was 61.2MB in the beginning and 57.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 740.11ms. Allocated memory is still 117.4MB. Free memory was 57.1MB in the beginning and 83.1MB in the end (delta: -26.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10056.61ms. Allocated memory was 117.4MB in the beginning and 461.4MB in the end (delta: 343.9MB). Free memory was 82.5MB in the beginning and 346.8MB in the end (delta: -264.3MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. * Witness Printer took 72.21ms. Allocated memory is still 461.4MB. Free memory was 346.8MB in the beginning and 342.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 5 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: 10.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 417 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 399 mSDsluCounter, 215 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1590 IncrementalHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 27 mSDtfsCounter, 1590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=467occurred in iteration=6, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 1601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 11:13:31,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE