./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1 --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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:24:19,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:24:19,976 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 11:24:19,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:24:19,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:24:20,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:24:20,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:24:20,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:24:20,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:24:20,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:24:20,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:24:20,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:24:20,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:24:20,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:24:20,004 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:24:20,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:24:20,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:24:20,004 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:24:20,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:24:20,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:24:20,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:24:20,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:24:20,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:24:20,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:24:20,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:24:20,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:24:20,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:24:20,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:24:20,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:24:20,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:24:20,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:24:20,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:24:20,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:24:20,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:24:20,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:24:20,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:24:20,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:24:20,008 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2024-12-02 11:24:20,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:24:20,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:24:20,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:24:20,233 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:24:20,233 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:24:20,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2024-12-02 11:24:23,120 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/data/88baaebbc/4faf8d0187594bfd953c8430f513bea3/FLAG8abebfe69 [2024-12-02 11:24:23,397 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:24:23,398 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2024-12-02 11:24:23,413 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/data/88baaebbc/4faf8d0187594bfd953c8430f513bea3/FLAG8abebfe69 [2024-12-02 11:24:23,429 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/data/88baaebbc/4faf8d0187594bfd953c8430f513bea3 [2024-12-02 11:24:23,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:24:23,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:24:23,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:24:23,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:24:23,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:24:23,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:23,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325b7963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23, skipping insertion in model container [2024-12-02 11:24:23,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:23,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:24:23,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2024-12-02 11:24:23,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:24:23,834 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:24:23,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2024-12-02 11:24:23,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:24:23,938 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:24:23,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23 WrapperNode [2024-12-02 11:24:23,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:24:23,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:24:23,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:24:23,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:24:23,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:23,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:23,986 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-12-02 11:24:23,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:24:23,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:24:23,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:24:23,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:24:23,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:23,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:24,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:24,017 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-12-02 11:24:24,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:24,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:24,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:24,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:24,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:24,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:24,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:24,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:24:24,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:24:24,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:24:24,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:24:24,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (1/1) ... [2024-12-02 11:24:24,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:24:24,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:24:24,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:24:24,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:24:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 11:24:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:24:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 11:24:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 11:24:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 11:24:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 11:24:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 11:24:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 11:24:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 11:24:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 11:24:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:24:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:24:24,099 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 11:24:24,222 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:24:24,224 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:24:24,506 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 11:24:24,507 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:24:24,676 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:24:24,676 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 11:24:24,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:24:24 BoogieIcfgContainer [2024-12-02 11:24:24,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:24:24,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:24:24,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:24:24,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:24:24,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:24:23" (1/3) ... [2024-12-02 11:24:24,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd6db5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:24:24, skipping insertion in model container [2024-12-02 11:24:24,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:23" (2/3) ... [2024-12-02 11:24:24,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd6db5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:24:24, skipping insertion in model container [2024-12-02 11:24:24,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:24:24" (3/3) ... [2024-12-02 11:24:24,685 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2024-12-02 11:24:24,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:24:24,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-12-02 11:24:24,699 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 11:24:24,749 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 11:24:24,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-12-02 11:24:24,818 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-12-02 11:24:24,821 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:24:24,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-12-02 11:24:24,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-12-02 11:24:24,828 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-12-02 11:24:24,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:24:24,848 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;@5805aeab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:24:24,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-12-02 11:24:24,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 11:24:24,857 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-12-02 11:24:24,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:24:24,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:24,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:24,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:24,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1803674900, now seen corresponding path program 1 times [2024-12-02 11:24:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:24,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985897874] [2024-12-02 11:24:24,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:25,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:25,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985897874] [2024-12-02 11:24:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985897874] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 11:24:25,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885948669] [2024-12-02 11:24:25,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:25,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:24:25,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:25,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:24:25,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:24:25,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39 [2024-12-02 11:24:25,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:25,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:25,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39 [2024-12-02 11:24:25,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:25,628 INFO L124 PetriNetUnfolderBase]: 315/627 cut-off events. [2024-12-02 11:24:25,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 11:24:25,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 627 events. 315/627 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3990 event pairs, 60 based on Foata normal form. 24/632 useless extension candidates. Maximal degree in co-relation 1139. Up to 382 conditions per place. [2024-12-02 11:24:25,636 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 23 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-12-02 11:24:25,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 149 flow [2024-12-02 11:24:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:24:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 11:24:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-12-02 11:24:25,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-12-02 11:24:25,652 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 87 transitions. [2024-12-02 11:24:25,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 149 flow [2024-12-02 11:24:25,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 11:24:25,660 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-12-02 11:24:25,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-12-02 11:24:25,667 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-12-02 11:24:25,667 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-12-02 11:24:25,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:25,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:25,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:25,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 11:24:25,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:25,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1194542543, now seen corresponding path program 1 times [2024-12-02 11:24:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449196230] [2024-12-02 11:24:25,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:26,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:26,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449196230] [2024-12-02 11:24:26,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449196230] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:26,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:26,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:24:26,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695714110] [2024-12-02 11:24:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:26,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:24:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:26,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:24:26,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:24:26,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-12-02 11:24:26,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:26,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:26,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-12-02 11:24:26,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:26,726 INFO L124 PetriNetUnfolderBase]: 1047/1848 cut-off events. [2024-12-02 11:24:26,726 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-12-02 11:24:26,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3602 conditions, 1848 events. 1047/1848 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11936 event pairs, 223 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 3592. Up to 1012 conditions per place. [2024-12-02 11:24:26,739 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 29 selfloop transitions, 3 changer transitions 40/84 dead transitions. [2024-12-02 11:24:26,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 338 flow [2024-12-02 11:24:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:24:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 11:24:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-12-02 11:24:26,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2024-12-02 11:24:26,742 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 194 transitions. [2024-12-02 11:24:26,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 338 flow [2024-12-02 11:24:26,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 11:24:26,746 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 105 flow [2024-12-02 11:24:26,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2024-12-02 11:24:26,747 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-12-02 11:24:26,747 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 105 flow [2024-12-02 11:24:26,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:26,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:26,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:26,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 11:24:26,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:26,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash -965906126, now seen corresponding path program 1 times [2024-12-02 11:24:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:26,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801066784] [2024-12-02 11:24:26,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:27,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-12-02 11:24:27,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:27,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801066784] [2024-12-02 11:24:27,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801066784] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:27,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:27,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:24:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767723969] [2024-12-02 11:24:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:27,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:24:27,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:27,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:24:27,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:24:27,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-12-02 11:24:27,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:27,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:27,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-12-02 11:24:27,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:27,453 INFO L124 PetriNetUnfolderBase]: 1055/1849 cut-off events. [2024-12-02 11:24:27,453 INFO L125 PetriNetUnfolderBase]: For 888/888 co-relation queries the response was YES. [2024-12-02 11:24:27,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 1849 events. 1055/1849 cut-off events. For 888/888 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11667 event pairs, 416 based on Foata normal form. 60/1855 useless extension candidates. Maximal degree in co-relation 4228. Up to 1157 conditions per place. [2024-12-02 11:24:27,462 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 29 selfloop transitions, 3 changer transitions 29/75 dead transitions. [2024-12-02 11:24:27,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 323 flow [2024-12-02 11:24:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:24:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 11:24:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-12-02 11:24:27,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-12-02 11:24:27,465 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 105 flow. Second operand 7 states and 168 transitions. [2024-12-02 11:24:27,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 323 flow [2024-12-02 11:24:27,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 312 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-12-02 11:24:27,473 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 133 flow [2024-12-02 11:24:27,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2024-12-02 11:24:27,474 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2024-12-02 11:24:27,474 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 133 flow [2024-12-02 11:24:27,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:27,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:27,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:27,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 11:24:27,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:27,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:27,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1074813900, now seen corresponding path program 1 times [2024-12-02 11:24:27,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:27,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88205474] [2024-12-02 11:24:27,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:28,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:28,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88205474] [2024-12-02 11:24:28,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88205474] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:28,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:28,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:24:28,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287661845] [2024-12-02 11:24:28,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:28,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:24:28,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:28,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:24:28,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:24:28,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-12-02 11:24:28,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-12-02 11:24:28,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:28,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-12-02 11:24:28,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:29,411 INFO L124 PetriNetUnfolderBase]: 2020/3523 cut-off events. [2024-12-02 11:24:29,411 INFO L125 PetriNetUnfolderBase]: For 4551/4551 co-relation queries the response was YES. [2024-12-02 11:24:29,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9666 conditions, 3523 events. 2020/3523 cut-off events. For 4551/4551 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24325 event pairs, 511 based on Foata normal form. 99/3600 useless extension candidates. Maximal degree in co-relation 9647. Up to 1729 conditions per place. [2024-12-02 11:24:29,438 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 35 selfloop transitions, 13 changer transitions 43/101 dead transitions. [2024-12-02 11:24:29,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 101 transitions, 604 flow [2024-12-02 11:24:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:24:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 11:24:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-12-02 11:24:29,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6483516483516484 [2024-12-02 11:24:29,440 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 133 flow. Second operand 7 states and 177 transitions. [2024-12-02 11:24:29,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 101 transitions, 604 flow [2024-12-02 11:24:29,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 588 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-12-02 11:24:29,452 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 290 flow [2024-12-02 11:24:29,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-12-02 11:24:29,453 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2024-12-02 11:24:29,454 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 290 flow [2024-12-02 11:24:29,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-12-02 11:24:29,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:29,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:29,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 11:24:29,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:29,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:29,455 INFO L85 PathProgramCache]: Analyzing trace with hash -584189772, now seen corresponding path program 2 times [2024-12-02 11:24:29,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:29,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873134380] [2024-12-02 11:24:29,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 11:24:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:29,476 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 11:24:29,476 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:24:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:29,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873134380] [2024-12-02 11:24:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873134380] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:29,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:29,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:24:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256780770] [2024-12-02 11:24:29,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:24:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:29,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:24:29,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:24:29,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-12-02 11:24:29,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:29,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:29,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-12-02 11:24:29,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:30,392 INFO L124 PetriNetUnfolderBase]: 2066/3784 cut-off events. [2024-12-02 11:24:30,392 INFO L125 PetriNetUnfolderBase]: For 10493/10533 co-relation queries the response was YES. [2024-12-02 11:24:30,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13345 conditions, 3784 events. 2066/3784 cut-off events. For 10493/10533 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 28127 event pairs, 684 based on Foata normal form. 109/3793 useless extension candidates. Maximal degree in co-relation 13321. Up to 1331 conditions per place. [2024-12-02 11:24:30,422 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 43 selfloop transitions, 6 changer transitions 39/105 dead transitions. [2024-12-02 11:24:30,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 808 flow [2024-12-02 11:24:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:24:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 11:24:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-12-02 11:24:30,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63003663003663 [2024-12-02 11:24:30,424 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 290 flow. Second operand 7 states and 172 transitions. [2024-12-02 11:24:30,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 808 flow [2024-12-02 11:24:30,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 742 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-12-02 11:24:30,439 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 288 flow [2024-12-02 11:24:30,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=288, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-12-02 11:24:30,440 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2024-12-02 11:24:30,440 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 288 flow [2024-12-02 11:24:30,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:30,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:30,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:30,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 11:24:30,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:30,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash -474902029, now seen corresponding path program 1 times [2024-12-02 11:24:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:30,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601481681] [2024-12-02 11:24:30,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:30,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:30,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601481681] [2024-12-02 11:24:30,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601481681] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:30,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:30,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:24:30,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93137193] [2024-12-02 11:24:30,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:30,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:24:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:30,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:24:30,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:24:30,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-12-02 11:24:30,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:30,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:30,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-12-02 11:24:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:31,885 INFO L124 PetriNetUnfolderBase]: 2514/4573 cut-off events. [2024-12-02 11:24:31,885 INFO L125 PetriNetUnfolderBase]: For 18568/18665 co-relation queries the response was YES. [2024-12-02 11:24:31,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16005 conditions, 4573 events. 2514/4573 cut-off events. For 18568/18665 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 34342 event pairs, 861 based on Foata normal form. 167/4596 useless extension candidates. Maximal degree in co-relation 15977. Up to 2803 conditions per place. [2024-12-02 11:24:31,923 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 29 selfloop transitions, 4 changer transitions 31/88 dead transitions. [2024-12-02 11:24:31,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 608 flow [2024-12-02 11:24:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:24:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 11:24:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-12-02 11:24:31,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6007326007326007 [2024-12-02 11:24:31,925 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 288 flow. Second operand 7 states and 164 transitions. [2024-12-02 11:24:31,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 608 flow [2024-12-02 11:24:31,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 578 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-12-02 11:24:31,960 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 320 flow [2024-12-02 11:24:31,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2024-12-02 11:24:31,961 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-12-02 11:24:31,961 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 320 flow [2024-12-02 11:24:31,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:31,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:31,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:31,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 11:24:31,962 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:31,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:31,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1874647077, now seen corresponding path program 1 times [2024-12-02 11:24:31,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:31,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670790191] [2024-12-02 11:24:31,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:31,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:32,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:32,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670790191] [2024-12-02 11:24:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670790191] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:32,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:32,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:24:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627323427] [2024-12-02 11:24:32,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:32,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:24:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:32,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:24:32,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:24:32,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-12-02 11:24:32,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-12-02 11:24:32,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:32,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-12-02 11:24:32,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:33,085 INFO L124 PetriNetUnfolderBase]: 2389/4346 cut-off events. [2024-12-02 11:24:33,085 INFO L125 PetriNetUnfolderBase]: For 19074/19119 co-relation queries the response was YES. [2024-12-02 11:24:33,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16661 conditions, 4346 events. 2389/4346 cut-off events. For 19074/19119 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 32682 event pairs, 399 based on Foata normal form. 124/4342 useless extension candidates. Maximal degree in co-relation 16631. Up to 2399 conditions per place. [2024-12-02 11:24:33,115 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 36 selfloop transitions, 10 changer transitions 31/101 dead transitions. [2024-12-02 11:24:33,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 778 flow [2024-12-02 11:24:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:24:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 11:24:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-12-02 11:24:33,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2024-12-02 11:24:33,117 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 320 flow. Second operand 8 states and 188 transitions. [2024-12-02 11:24:33,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 778 flow [2024-12-02 11:24:33,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 762 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-12-02 11:24:33,147 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 391 flow [2024-12-02 11:24:33,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=391, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2024-12-02 11:24:33,148 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2024-12-02 11:24:33,148 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 391 flow [2024-12-02 11:24:33,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-12-02 11:24:33,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:33,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:33,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 11:24:33,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:33,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1356959317, now seen corresponding path program 2 times [2024-12-02 11:24:33,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:33,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192374279] [2024-12-02 11:24:33,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 11:24:33,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:33,185 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 11:24:33,185 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:24:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192374279] [2024-12-02 11:24:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192374279] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:24:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793786265] [2024-12-02 11:24:33,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:33,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:24:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:33,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:24:33,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:24:33,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-12-02 11:24:33,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-12-02 11:24:33,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:33,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-12-02 11:24:33,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:34,379 INFO L124 PetriNetUnfolderBase]: 2239/4120 cut-off events. [2024-12-02 11:24:34,379 INFO L125 PetriNetUnfolderBase]: For 22325/22388 co-relation queries the response was YES. [2024-12-02 11:24:34,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16569 conditions, 4120 events. 2239/4120 cut-off events. For 22325/22388 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 30393 event pairs, 394 based on Foata normal form. 131/4142 useless extension candidates. Maximal degree in co-relation 16535. Up to 2337 conditions per place. [2024-12-02 11:24:34,402 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 35 selfloop transitions, 7 changer transitions 32/98 dead transitions. [2024-12-02 11:24:34,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 809 flow [2024-12-02 11:24:34,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:24:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 11:24:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-12-02 11:24:34,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2024-12-02 11:24:34,404 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 391 flow. Second operand 8 states and 184 transitions. [2024-12-02 11:24:34,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 809 flow [2024-12-02 11:24:34,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 98 transitions, 750 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-12-02 11:24:34,468 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 371 flow [2024-12-02 11:24:34,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=371, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2024-12-02 11:24:34,468 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2024-12-02 11:24:34,469 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 371 flow [2024-12-02 11:24:34,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-12-02 11:24:34,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:34,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:34,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:24:34,469 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:34,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash 149705955, now seen corresponding path program 1 times [2024-12-02 11:24:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825296887] [2024-12-02 11:24:34,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:34,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:34,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825296887] [2024-12-02 11:24:34,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825296887] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:34,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:34,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:24:34,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035173741] [2024-12-02 11:24:34,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:34,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:24:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:34,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:24:34,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:24:34,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-12-02 11:24:34,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-12-02 11:24:34,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:34,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-12-02 11:24:34,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:35,517 INFO L124 PetriNetUnfolderBase]: 3144/5917 cut-off events. [2024-12-02 11:24:35,517 INFO L125 PetriNetUnfolderBase]: For 31165/31271 co-relation queries the response was YES. [2024-12-02 11:24:35,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22471 conditions, 5917 events. 3144/5917 cut-off events. For 31165/31271 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 49104 event pairs, 1191 based on Foata normal form. 190/5883 useless extension candidates. Maximal degree in co-relation 22435. Up to 2106 conditions per place. [2024-12-02 11:24:35,548 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 41 selfloop transitions, 5 changer transitions 34/99 dead transitions. [2024-12-02 11:24:35,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 825 flow [2024-12-02 11:24:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:24:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 11:24:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-12-02 11:24:35,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5970695970695971 [2024-12-02 11:24:35,550 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 371 flow. Second operand 7 states and 163 transitions. [2024-12-02 11:24:35,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 825 flow [2024-12-02 11:24:35,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 779 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-12-02 11:24:35,610 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 362 flow [2024-12-02 11:24:35,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2024-12-02 11:24:35,611 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2024-12-02 11:24:35,611 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 362 flow [2024-12-02 11:24:35,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-12-02 11:24:35,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:35,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:35,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 11:24:35,612 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:35,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1644694731, now seen corresponding path program 1 times [2024-12-02 11:24:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:35,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830013036] [2024-12-02 11:24:35,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:35,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:36,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:36,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830013036] [2024-12-02 11:24:36,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830013036] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:36,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:36,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:24:36,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234819926] [2024-12-02 11:24:36,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:36,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:24:36,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:36,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:24:36,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:24:36,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-12-02 11:24:36,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-12-02 11:24:36,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:36,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-12-02 11:24:36,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:36,947 INFO L124 PetriNetUnfolderBase]: 3251/6162 cut-off events. [2024-12-02 11:24:36,947 INFO L125 PetriNetUnfolderBase]: For 33666/33769 co-relation queries the response was YES. [2024-12-02 11:24:36,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23162 conditions, 6162 events. 3251/6162 cut-off events. For 33666/33769 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 51003 event pairs, 1205 based on Foata normal form. 237/6188 useless extension candidates. Maximal degree in co-relation 23126. Up to 3740 conditions per place. [2024-12-02 11:24:36,976 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 37 selfloop transitions, 9 changer transitions 27/97 dead transitions. [2024-12-02 11:24:36,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 97 transitions, 775 flow [2024-12-02 11:24:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:24:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 11:24:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-12-02 11:24:36,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2024-12-02 11:24:36,977 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 362 flow. Second operand 8 states and 184 transitions. [2024-12-02 11:24:36,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 97 transitions, 775 flow [2024-12-02 11:24:37,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 746 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-12-02 11:24:37,059 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 467 flow [2024-12-02 11:24:37,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=467, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2024-12-02 11:24:37,060 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2024-12-02 11:24:37,060 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 467 flow [2024-12-02 11:24:37,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-12-02 11:24:37,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:37,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:37,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 11:24:37,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:37,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:37,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1790569789, now seen corresponding path program 2 times [2024-12-02 11:24:37,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:37,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338445458] [2024-12-02 11:24:37,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 11:24:37,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:37,090 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 11:24:37,090 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:24:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:37,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:37,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338445458] [2024-12-02 11:24:37,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338445458] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:37,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:37,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:24:37,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217969673] [2024-12-02 11:24:37,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:37,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:24:37,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:37,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:24:37,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:24:37,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-12-02 11:24:37,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 467 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-12-02 11:24:37,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:37,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-12-02 11:24:37,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:38,213 INFO L124 PetriNetUnfolderBase]: 5709/9609 cut-off events. [2024-12-02 11:24:38,213 INFO L125 PetriNetUnfolderBase]: For 38505/38912 co-relation queries the response was YES. [2024-12-02 11:24:38,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33422 conditions, 9609 events. 5709/9609 cut-off events. For 38505/38912 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 71500 event pairs, 981 based on Foata normal form. 696/10085 useless extension candidates. Maximal degree in co-relation 33383. Up to 5001 conditions per place. [2024-12-02 11:24:38,259 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 66 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2024-12-02 11:24:38,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 96 transitions, 854 flow [2024-12-02 11:24:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:24:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 11:24:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-12-02 11:24:38,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-12-02 11:24:38,260 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 467 flow. Second operand 4 states and 104 transitions. [2024-12-02 11:24:38,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 96 transitions, 854 flow [2024-12-02 11:24:38,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 817 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-12-02 11:24:38,305 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 471 flow [2024-12-02 11:24:38,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=471, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2024-12-02 11:24:38,305 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2024-12-02 11:24:38,305 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 471 flow [2024-12-02 11:24:38,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-12-02 11:24:38,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:38,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:38,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 11:24:38,306 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:38,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:38,306 INFO L85 PathProgramCache]: Analyzing trace with hash 346236268, now seen corresponding path program 1 times [2024-12-02 11:24:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077633917] [2024-12-02 11:24:38,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:38,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-12-02 11:24:38,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:38,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077633917] [2024-12-02 11:24:38,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077633917] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:38,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:38,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:24:38,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161762011] [2024-12-02 11:24:38,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:38,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:24:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:38,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:24:38,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:24:38,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-12-02 11:24:38,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 471 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-12-02 11:24:38,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:38,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-12-02 11:24:38,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:39,724 INFO L124 PetriNetUnfolderBase]: 3720/6889 cut-off events. [2024-12-02 11:24:39,724 INFO L125 PetriNetUnfolderBase]: For 29201/29535 co-relation queries the response was YES. [2024-12-02 11:24:39,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26442 conditions, 6889 events. 3720/6889 cut-off events. For 29201/29535 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 55758 event pairs, 1766 based on Foata normal form. 91/6446 useless extension candidates. Maximal degree in co-relation 26402. Up to 4885 conditions per place. [2024-12-02 11:24:39,761 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 36 selfloop transitions, 12 changer transitions 21/97 dead transitions. [2024-12-02 11:24:39,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 97 transitions, 863 flow [2024-12-02 11:24:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:24:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 11:24:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-12-02 11:24:39,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-12-02 11:24:39,763 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 471 flow. Second operand 6 states and 144 transitions. [2024-12-02 11:24:39,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 97 transitions, 863 flow [2024-12-02 11:24:39,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 97 transitions, 839 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-12-02 11:24:39,812 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 554 flow [2024-12-02 11:24:39,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2024-12-02 11:24:39,813 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2024-12-02 11:24:39,813 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 554 flow [2024-12-02 11:24:39,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-12-02 11:24:39,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:39,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:39,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 11:24:39,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:39,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2072144776, now seen corresponding path program 1 times [2024-12-02 11:24:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:39,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710470035] [2024-12-02 11:24:39,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:39,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710470035] [2024-12-02 11:24:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710470035] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:39,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:39,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:24:39,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296618469] [2024-12-02 11:24:39,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:40,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:24:40,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:40,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:24:40,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:24:40,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-12-02 11:24:40,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 554 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:40,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:40,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-12-02 11:24:40,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:40,874 INFO L124 PetriNetUnfolderBase]: 4292/7182 cut-off events. [2024-12-02 11:24:40,874 INFO L125 PetriNetUnfolderBase]: For 29133/30046 co-relation queries the response was YES. [2024-12-02 11:24:40,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26314 conditions, 7182 events. 4292/7182 cut-off events. For 29133/30046 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 50896 event pairs, 434 based on Foata normal form. 637/7553 useless extension candidates. Maximal degree in co-relation 26272. Up to 2608 conditions per place. [2024-12-02 11:24:40,895 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 64 selfloop transitions, 8 changer transitions 5/100 dead transitions. [2024-12-02 11:24:40,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 897 flow [2024-12-02 11:24:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:24:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 11:24:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-12-02 11:24:40,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.676923076923077 [2024-12-02 11:24:40,897 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 554 flow. Second operand 5 states and 132 transitions. [2024-12-02 11:24:40,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 897 flow [2024-12-02 11:24:40,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 806 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-12-02 11:24:40,930 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 440 flow [2024-12-02 11:24:40,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2024-12-02 11:24:40,930 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2024-12-02 11:24:40,930 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 440 flow [2024-12-02 11:24:40,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:24:40,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:40,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:40,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 11:24:40,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:40,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1861499637, now seen corresponding path program 1 times [2024-12-02 11:24:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995067679] [2024-12-02 11:24:40,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:41,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:41,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995067679] [2024-12-02 11:24:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995067679] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:41,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:41,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 11:24:41,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098620933] [2024-12-02 11:24:41,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:41,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 11:24:41,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:41,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 11:24:41,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:24:41,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-12-02 11:24:41,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 440 flow. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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-12-02 11:24:41,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:41,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-12-02 11:24:41,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:42,607 INFO L124 PetriNetUnfolderBase]: 2592/5093 cut-off events. [2024-12-02 11:24:42,607 INFO L125 PetriNetUnfolderBase]: For 16762/17662 co-relation queries the response was YES. [2024-12-02 11:24:42,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18912 conditions, 5093 events. 2592/5093 cut-off events. For 16762/17662 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 41251 event pairs, 854 based on Foata normal form. 164/4791 useless extension candidates. Maximal degree in co-relation 18873. Up to 3143 conditions per place. [2024-12-02 11:24:42,634 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 31 selfloop transitions, 13 changer transitions 21/96 dead transitions. [2024-12-02 11:24:42,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 764 flow [2024-12-02 11:24:42,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:24:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-12-02 11:24:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2024-12-02 11:24:42,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5698005698005698 [2024-12-02 11:24:42,635 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 440 flow. Second operand 9 states and 200 transitions. [2024-12-02 11:24:42,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 764 flow [2024-12-02 11:24:42,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 96 transitions, 748 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-12-02 11:24:42,678 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 522 flow [2024-12-02 11:24:42,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=522, PETRI_PLACES=87, PETRI_TRANSITIONS=65} [2024-12-02 11:24:42,678 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2024-12-02 11:24:42,678 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 65 transitions, 522 flow [2024-12-02 11:24:42,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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-12-02 11:24:42,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:42,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:42,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 11:24:42,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:42,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2011057043, now seen corresponding path program 2 times [2024-12-02 11:24:42,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:42,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252502678] [2024-12-02 11:24:42,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 11:24:42,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:42,731 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 11:24:42,731 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 11:24:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:42,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:42,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252502678] [2024-12-02 11:24:42,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252502678] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:42,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:42,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:24:42,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455098562] [2024-12-02 11:24:42,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:42,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:24:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:42,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:24:42,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:24:42,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-12-02 11:24:42,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 65 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-12-02 11:24:42,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:42,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-12-02 11:24:42,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:43,643 INFO L124 PetriNetUnfolderBase]: 3679/6169 cut-off events. [2024-12-02 11:24:43,643 INFO L125 PetriNetUnfolderBase]: For 34392/35490 co-relation queries the response was YES. [2024-12-02 11:24:43,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25062 conditions, 6169 events. 3679/6169 cut-off events. For 34392/35490 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 43676 event pairs, 396 based on Foata normal form. 566/6469 useless extension candidates. Maximal degree in co-relation 25020. Up to 2588 conditions per place. [2024-12-02 11:24:43,662 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 43 selfloop transitions, 11 changer transitions 36/105 dead transitions. [2024-12-02 11:24:43,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 105 transitions, 989 flow [2024-12-02 11:24:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:24:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 11:24:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-12-02 11:24:43,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6239316239316239 [2024-12-02 11:24:43,663 INFO L175 Difference]: Start difference. First operand has 87 places, 65 transitions, 522 flow. Second operand 6 states and 146 transitions. [2024-12-02 11:24:43,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 105 transitions, 989 flow [2024-12-02 11:24:43,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 825 flow, removed 64 selfloop flow, removed 14 redundant places. [2024-12-02 11:24:43,717 INFO L231 Difference]: Finished difference. Result has 76 places, 49 transitions, 332 flow [2024-12-02 11:24:43,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=76, PETRI_TRANSITIONS=49} [2024-12-02 11:24:43,717 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2024-12-02 11:24:43,717 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 49 transitions, 332 flow [2024-12-02 11:24:43,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-12-02 11:24:43,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:43,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:43,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 11:24:43,718 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:43,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1560816879, now seen corresponding path program 1 times [2024-12-02 11:24:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:43,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286063461] [2024-12-02 11:24:43,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:43,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:24:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:24:44,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286063461] [2024-12-02 11:24:44,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286063461] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:24:44,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:24:44,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 11:24:44,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466783481] [2024-12-02 11:24:44,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:24:44,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:24:44,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:24:44,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:24:44,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:24:44,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-12-02 11:24:44,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 49 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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-12-02 11:24:44,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 11:24:44,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-12-02 11:24:44,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 11:24:45,116 INFO L124 PetriNetUnfolderBase]: 495/1031 cut-off events. [2024-12-02 11:24:45,116 INFO L125 PetriNetUnfolderBase]: For 2741/2929 co-relation queries the response was YES. [2024-12-02 11:24:45,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 1031 events. 495/1031 cut-off events. For 2741/2929 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6306 event pairs, 139 based on Foata normal form. 27/934 useless extension candidates. Maximal degree in co-relation 3422. Up to 381 conditions per place. [2024-12-02 11:24:45,119 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 21 selfloop transitions, 4 changer transitions 20/68 dead transitions. [2024-12-02 11:24:45,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 68 transitions, 484 flow [2024-12-02 11:24:45,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:24:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 11:24:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-12-02 11:24:45,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-12-02 11:24:45,120 INFO L175 Difference]: Start difference. First operand has 76 places, 49 transitions, 332 flow. Second operand 8 states and 169 transitions. [2024-12-02 11:24:45,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 68 transitions, 484 flow [2024-12-02 11:24:45,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 391 flow, removed 31 selfloop flow, removed 14 redundant places. [2024-12-02 11:24:45,126 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 235 flow [2024-12-02 11:24:45,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2024-12-02 11:24:45,126 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2024-12-02 11:24:45,126 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 235 flow [2024-12-02 11:24:45,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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-12-02 11:24:45,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 11:24:45,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:45,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 11:24:45,127 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 11:24:45,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:45,127 INFO L85 PathProgramCache]: Analyzing trace with hash 720872757, now seen corresponding path program 2 times [2024-12-02 11:24:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:24:45,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183701841] [2024-12-02 11:24:45,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 11:24:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:24:45,167 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 11:24:45,167 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 11:24:45,168 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:24:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:24:45,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:24:45,251 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:24:45,252 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-12-02 11:24:45,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-12-02 11:24:45,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-12-02 11:24:45,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-12-02 11:24:45,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-12-02 11:24:45,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-12-02 11:24:45,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 11:24:45,254 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:24:45,311 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 11:24:45,312 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 11:24:45,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:24:45 BasicIcfg [2024-12-02 11:24:45,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 11:24:45,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 11:24:45,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 11:24:45,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 11:24:45,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:24:24" (3/4) ... [2024-12-02 11:24:45,320 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 11:24:45,395 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-12-02 11:24:45,440 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 11:24:45,441 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 11:24:45,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 11:24:45,442 INFO L158 Benchmark]: Toolchain (without parser) took 22008.50ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 91.3MB in the beginning and 784.0MB in the end (delta: -692.7MB). Peak memory consumption was 319.2MB. Max. memory is 16.1GB. [2024-12-02 11:24:45,442 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 72.8MB in the end (delta: 84.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:24:45,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.75ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 68.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 11:24:45,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.08ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 65.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:24:45,444 INFO L158 Benchmark]: Boogie Preprocessor took 46.87ms. Allocated memory is still 117.4MB. Free memory was 65.8MB in the beginning and 63.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:24:45,444 INFO L158 Benchmark]: RCFGBuilder took 642.54ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 68.5MB in the end (delta: -5.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-12-02 11:24:45,444 INFO L158 Benchmark]: TraceAbstraction took 20638.26ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 68.0MB in the beginning and 800.8MB in the end (delta: -732.8MB). Peak memory consumption was 280.3MB. Max. memory is 16.1GB. [2024-12-02 11:24:45,445 INFO L158 Benchmark]: Witness Printer took 123.13ms. Allocated memory is still 1.1GB. Free memory was 800.8MB in the beginning and 784.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:24:45,447 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.30ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 72.8MB in the end (delta: 84.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.75ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 68.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.08ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 65.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.87ms. Allocated memory is still 117.4MB. Free memory was 65.8MB in the beginning and 63.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 642.54ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 68.5MB in the end (delta: -5.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20638.26ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 68.0MB in the beginning and 800.8MB in the end (delta: -732.8MB). Peak memory consumption was 280.3MB. Max. memory is 16.1GB. * Witness Printer took 123.13ms. Allocated memory is still 1.1GB. Free memory was 800.8MB in the beginning and 784.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-2, t2493=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 621 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 598 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1936 IncrementalHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 51 mSDtfsCounter, 1936 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=554occurred in iteration=12, InterpolantAutomatonStates: 108, 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, 6.7s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 2285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-12-02 11:24:45,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc87f8a7-9437-464e-b9ff-e9580be03a45/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE