./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe004_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_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/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_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/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_b6b1202d-206c-4bc7-9246-3e00e58d688c/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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:32:14,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:32:14,252 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 14:32:14,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:32:14,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:32:14,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:32:14,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:32:14,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:32:14,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:32:14,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:32:14,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:32:14,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:32:14,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:32:14,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:32:14,279 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:32:14,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:32:14,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:32:14,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:32:14,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:32:14,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:32:14,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:32:14,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:32:14,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:32:14,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:32:14,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:32:14,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:32:14,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:32:14,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:32:14,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:32:14,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:32:14,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:32:14,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:32:14,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:32:14,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:32:14,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:32:14,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:32:14,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:32:14,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:32:14,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:32:14,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:32:14,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:32:14,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:32:14,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:32:14,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:32:14,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:32:14,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:32:14,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:32:14,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:32:14,283 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_b6b1202d-206c-4bc7-9246-3e00e58d688c/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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 [2024-12-02 14:32:14,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:32:14,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:32:14,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:32:14,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:32:14,491 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:32:14,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2024-12-02 14:32:17,094 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/data/8b93da88f/024676b23d594c7b8f2a6bbb2b1b89ff/FLAGf4422c711 [2024-12-02 14:32:17,331 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:32:17,332 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2024-12-02 14:32:17,345 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/data/8b93da88f/024676b23d594c7b8f2a6bbb2b1b89ff/FLAGf4422c711 [2024-12-02 14:32:17,660 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/data/8b93da88f/024676b23d594c7b8f2a6bbb2b1b89ff [2024-12-02 14:32:17,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:32:17,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:32:17,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:32:17,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:32:17,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:32:17,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:32:17" (1/1) ... [2024-12-02 14:32:17,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb4fdb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:17, skipping insertion in model container [2024-12-02 14:32:17,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:32:17" (1/1) ... [2024-12-02 14:32:17,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:32:17,816 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_b6b1202d-206c-4bc7-9246-3e00e58d688c/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2024-12-02 14:32:17,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:32:17,964 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:32:17,974 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_b6b1202d-206c-4bc7-9246-3e00e58d688c/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2024-12-02 14:32:18,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:32:18,050 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:32:18,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18 WrapperNode [2024-12-02 14:32:18,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:32:18,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:32:18,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:32:18,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:32:18,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,092 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-12-02 14:32:18,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:32:18,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:32:18,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:32:18,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:32:18,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,119 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 14:32:18,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:32:18,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:32:18,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:32:18,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:32:18,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (1/1) ... [2024-12-02 14:32:18,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:32:18,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:32:18,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:32:18,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:32:18,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 14:32:18,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:32:18,187 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 14:32:18,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 14:32:18,188 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 14:32:18,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 14:32:18,188 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 14:32:18,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 14:32:18,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:32:18,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 14:32:18,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:32:18,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:32:18,190 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 14:32:18,309 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:32:18,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:32:18,579 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 14:32:18,579 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:32:18,768 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:32:18,768 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 14:32:18,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:32:18 BoogieIcfgContainer [2024-12-02 14:32:18,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:32:18,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:32:18,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:32:18,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:32:18,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:32:17" (1/3) ... [2024-12-02 14:32:18,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6322e598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:32:18, skipping insertion in model container [2024-12-02 14:32:18,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:32:18" (2/3) ... [2024-12-02 14:32:18,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6322e598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:32:18, skipping insertion in model container [2024-12-02 14:32:18,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:32:18" (3/3) ... [2024-12-02 14:32:18,777 INFO L128 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2024-12-02 14:32:18,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:32:18,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe004_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 14:32:18,794 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 14:32:18,843 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 14:32:18,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-12-02 14:32:18,906 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-12-02 14:32:18,908 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:32:18,911 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 14:32:18,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-12-02 14:32:18,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-12-02 14:32:18,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:32:18,933 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;@23cae47a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:32:18,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-12-02 14:32:18,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 14:32:18,939 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-12-02 14:32:18,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 14:32:18,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:32:18,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 14:32:18,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 14:32:18,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:32:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1906582196, now seen corresponding path program 1 times [2024-12-02 14:32:18,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:32:18,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513381611] [2024-12-02 14:32:18,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:32:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:32:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:32:19,333 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 14:32:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:32:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513381611] [2024-12-02 14:32:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513381611] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:32:19,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:32:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 14:32:19,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003645601] [2024-12-02 14:32:19,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:32:19,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:32:19,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:32:19,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:32:19,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:32:19,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-12-02 14:32:19,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 14:32:19,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:32:19,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-12-02 14:32:19,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:32:19,698 INFO L124 PetriNetUnfolderBase]: 528/983 cut-off events. [2024-12-02 14:32:19,698 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-12-02 14:32:19,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 983 events. 528/983 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5745 event pairs, 168 based on Foata normal form. 36/998 useless extension candidates. Maximal degree in co-relation 1820. Up to 652 conditions per place. [2024-12-02 14:32:19,707 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 27 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2024-12-02 14:32:19,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 166 flow [2024-12-02 14:32:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:32:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 14:32:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-12-02 14:32:19,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2024-12-02 14:32:19,721 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 88 transitions. [2024-12-02 14:32:19,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 166 flow [2024-12-02 14:32:19,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 14:32:19,728 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-12-02 14:32:19,731 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 14:32:19,734 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-12-02 14:32:19,734 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-12-02 14:32:19,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 14:32:19,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:32:19,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:32:19,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:32:19,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 14:32:19,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:32:19,736 INFO L85 PathProgramCache]: Analyzing trace with hash -103316819, now seen corresponding path program 1 times [2024-12-02 14:32:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:32:19,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760169440] [2024-12-02 14:32:19,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:32:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:32:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:32:20,032 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 14:32:20,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:32:20,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760169440] [2024-12-02 14:32:20,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760169440] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:32:20,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:32:20,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:32:20,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781497996] [2024-12-02 14:32:20,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:32:20,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:32:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:32:20,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:32:20,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:32:20,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-12-02 14:32:20,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:32:20,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:32:20,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-12-02 14:32:20,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:32:20,360 INFO L124 PetriNetUnfolderBase]: 1213/2071 cut-off events. [2024-12-02 14:32:20,360 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-12-02 14:32:20,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 2071 events. 1213/2071 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12674 event pairs, 147 based on Foata normal form. 80/2046 useless extension candidates. Maximal degree in co-relation 4073. Up to 1081 conditions per place. [2024-12-02 14:32:20,371 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 39 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2024-12-02 14:32:20,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 220 flow [2024-12-02 14:32:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:32:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 14:32:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-12-02 14:32:20,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2024-12-02 14:32:20,373 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 103 transitions. [2024-12-02 14:32:20,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 220 flow [2024-12-02 14:32:20,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 14:32:20,375 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2024-12-02 14:32:20,375 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-12-02 14:32:20,376 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-12-02 14:32:20,376 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2024-12-02 14:32:20,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:32:20,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:32:20,376 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 14:32:20,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:32:20,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 14:32:20,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:32:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash 563689561, now seen corresponding path program 1 times [2024-12-02 14:32:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:32:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886467128] [2024-12-02 14:32:20,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:32:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:32:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:32:20,615 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 14:32:20,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:32:20,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886467128] [2024-12-02 14:32:20,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886467128] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:32:20,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:32:20,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:32:20,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600945435] [2024-12-02 14:32:20,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:32:20,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:32:20,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:32:20,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:32:20,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:32:20,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-12-02 14:32:20,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 14:32:20,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:32:20,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-12-02 14:32:20,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:32:20,900 INFO L124 PetriNetUnfolderBase]: 809/1399 cut-off events. [2024-12-02 14:32:20,900 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2024-12-02 14:32:20,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 1399 events. 809/1399 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7568 event pairs, 73 based on Foata normal form. 68/1401 useless extension candidates. Maximal degree in co-relation 3193. Up to 521 conditions per place. [2024-12-02 14:32:20,908 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 49 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2024-12-02 14:32:20,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 309 flow [2024-12-02 14:32:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:32:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 14:32:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-12-02 14:32:20,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-12-02 14:32:20,910 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 130 transitions. [2024-12-02 14:32:20,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 309 flow [2024-12-02 14:32:20,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 299 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 14:32:20,912 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2024-12-02 14:32:20,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-12-02 14:32:20,913 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-12-02 14:32:20,913 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2024-12-02 14:32:20,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 14:32:20,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:32:20,913 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] [2024-12-02 14:32:20,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:32:20,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 14:32:20,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:32:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1439963883, now seen corresponding path program 1 times [2024-12-02 14:32:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:32:20,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007562582] [2024-12-02 14:32:20,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:32:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:32:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:32:21,244 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 14:32:21,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:32:21,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007562582] [2024-12-02 14:32:21,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007562582] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:32:21,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:32:21,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:32:21,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720753180] [2024-12-02 14:32:21,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:32:21,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:32:21,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:32:21,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:32:21,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:32:21,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-12-02 14:32:21,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:32:21,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:32:21,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-12-02 14:32:21,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:32:21,486 INFO L124 PetriNetUnfolderBase]: 477/811 cut-off events. [2024-12-02 14:32:21,486 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-12-02 14:32:21,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 811 events. 477/811 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3693 event pairs, 59 based on Foata normal form. 36/812 useless extension candidates. Maximal degree in co-relation 2109. Up to 268 conditions per place. [2024-12-02 14:32:21,490 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 43 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2024-12-02 14:32:21,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 320 flow [2024-12-02 14:32:21,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:32:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 14:32:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-12-02 14:32:21,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2024-12-02 14:32:21,492 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 141 transitions. [2024-12-02 14:32:21,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 320 flow [2024-12-02 14:32:21,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-12-02 14:32:21,497 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2024-12-02 14:32:21,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-12-02 14:32:21,498 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-12-02 14:32:21,498 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2024-12-02 14:32:21,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:32:21,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:32:21,499 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 14:32:21,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:32:21,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 14:32:21,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:32:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash 293523438, now seen corresponding path program 1 times [2024-12-02 14:32:21,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:32:21,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871055810] [2024-12-02 14:32:21,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:32:21,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:32:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:32:22,213 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 14:32:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:32:22,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871055810] [2024-12-02 14:32:22,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871055810] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:32:22,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:32:22,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:32:22,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23003270] [2024-12-02 14:32:22,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:32:22,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:32:22,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:32:22,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:32:22,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:32:22,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-12-02 14:32:22,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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 14:32:22,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:32:22,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-12-02 14:32:22,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:32:22,575 INFO L124 PetriNetUnfolderBase]: 979/1745 cut-off events. [2024-12-02 14:32:22,575 INFO L125 PetriNetUnfolderBase]: For 716/730 co-relation queries the response was YES. [2024-12-02 14:32:22,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4040 conditions, 1745 events. 979/1745 cut-off events. For 716/730 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9814 event pairs, 200 based on Foata normal form. 8/1716 useless extension candidates. Maximal degree in co-relation 4025. Up to 734 conditions per place. [2024-12-02 14:32:22,580 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 34 selfloop transitions, 10 changer transitions 16/76 dead transitions. [2024-12-02 14:32:22,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 368 flow [2024-12-02 14:32:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:32:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 14:32:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-12-02 14:32:22,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.594017094017094 [2024-12-02 14:32:22,582 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 6 states and 139 transitions. [2024-12-02 14:32:22,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 368 flow [2024-12-02 14:32:22,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 304 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-12-02 14:32:22,591 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 176 flow [2024-12-02 14:32:22,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-12-02 14:32:22,591 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2024-12-02 14:32:22,591 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 176 flow [2024-12-02 14:32:22,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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 14:32:22,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:32:22,592 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 14:32:22,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:32:22,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 14:32:22,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:32:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash -408786718, now seen corresponding path program 2 times [2024-12-02 14:32:22,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:32:22,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68020870] [2024-12-02 14:32:22,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:32:22,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:32:22,658 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 14:32:22,658 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:32:23,163 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 14:32:23,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:32:23,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68020870] [2024-12-02 14:32:23,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68020870] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:32:23,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:32:23,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:32:23,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062890989] [2024-12-02 14:32:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:32:23,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:32:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:32:23,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:32:23,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:32:23,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-12-02 14:32:23,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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 14:32:23,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:32:23,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-12-02 14:32:23,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:32:23,549 INFO L124 PetriNetUnfolderBase]: 795/1434 cut-off events. [2024-12-02 14:32:23,549 INFO L125 PetriNetUnfolderBase]: For 488/514 co-relation queries the response was YES. [2024-12-02 14:32:23,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3640 conditions, 1434 events. 795/1434 cut-off events. For 488/514 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7809 event pairs, 165 based on Foata normal form. 10/1381 useless extension candidates. Maximal degree in co-relation 3624. Up to 533 conditions per place. [2024-12-02 14:32:23,558 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 32 selfloop transitions, 12 changer transitions 26/86 dead transitions. [2024-12-02 14:32:23,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 458 flow [2024-12-02 14:32:23,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:32:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 14:32:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-12-02 14:32:23,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5457875457875457 [2024-12-02 14:32:23,560 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 176 flow. Second operand 7 states and 149 transitions. [2024-12-02 14:32:23,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 458 flow [2024-12-02 14:32:23,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 443 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-12-02 14:32:23,563 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 235 flow [2024-12-02 14:32:23,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-12-02 14:32:23,564 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2024-12-02 14:32:23,564 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 235 flow [2024-12-02 14:32:23,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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 14:32:23,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:32:23,564 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 14:32:23,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:32:23,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 14:32:23,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:32:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1338316966, now seen corresponding path program 3 times [2024-12-02 14:32:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:32:23,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899402590] [2024-12-02 14:32:23,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 14:32:23,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:32:23,640 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 14:32:23,640 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:32:24,151 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 14:32:24,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:32:24,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899402590] [2024-12-02 14:32:24,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899402590] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:32:24,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:32:24,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 14:32:24,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112778877] [2024-12-02 14:32:24,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:32:24,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:32:24,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:32:24,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:32:24,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:32:24,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-12-02 14:32:24,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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 14:32:24,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:32:24,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-12-02 14:32:24,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:32:24,640 INFO L124 PetriNetUnfolderBase]: 620/1159 cut-off events. [2024-12-02 14:32:24,640 INFO L125 PetriNetUnfolderBase]: For 814/814 co-relation queries the response was YES. [2024-12-02 14:32:24,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3186 conditions, 1159 events. 620/1159 cut-off events. For 814/814 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5944 event pairs, 93 based on Foata normal form. 8/1133 useless extension candidates. Maximal degree in co-relation 3166. Up to 448 conditions per place. [2024-12-02 14:32:24,647 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 28 selfloop transitions, 10 changer transitions 31/85 dead transitions. [2024-12-02 14:32:24,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 508 flow [2024-12-02 14:32:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:32:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 14:32:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-12-02 14:32:24,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-12-02 14:32:24,649 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 235 flow. Second operand 8 states and 169 transitions. [2024-12-02 14:32:24,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 508 flow [2024-12-02 14:32:24,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 492 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-12-02 14:32:24,652 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 238 flow [2024-12-02 14:32:24,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2024-12-02 14:32:24,653 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-12-02 14:32:24,653 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 238 flow [2024-12-02 14:32:24,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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 14:32:24,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:32:24,654 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 14:32:24,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:32:24,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 14:32:24,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:32:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash -524278230, now seen corresponding path program 4 times [2024-12-02 14:32:24,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:32:24,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422498866] [2024-12-02 14:32:24,655 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 14:32:24,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:32:24,737 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 14:32:24,737 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:32:25,994 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 14:32:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:32:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422498866] [2024-12-02 14:32:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422498866] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:32:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:32:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 14:32:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944135545] [2024-12-02 14:32:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:32:25,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 14:32:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:32:25,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 14:32:25,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:32:26,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-12-02 14:32:26,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 238 flow. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 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 14:32:26,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:32:26,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-12-02 14:32:26,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:32:26,348 INFO L124 PetriNetUnfolderBase]: 490/966 cut-off events. [2024-12-02 14:32:26,348 INFO L125 PetriNetUnfolderBase]: For 596/596 co-relation queries the response was YES. [2024-12-02 14:32:26,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2477 conditions, 966 events. 490/966 cut-off events. For 596/596 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4984 event pairs, 86 based on Foata normal form. 8/930 useless extension candidates. Maximal degree in co-relation 2453. Up to 402 conditions per place. [2024-12-02 14:32:26,352 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 28 selfloop transitions, 8 changer transitions 11/69 dead transitions. [2024-12-02 14:32:26,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 410 flow [2024-12-02 14:32:26,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:32:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 14:32:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-12-02 14:32:26,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-12-02 14:32:26,353 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 238 flow. Second operand 7 states and 156 transitions. [2024-12-02 14:32:26,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 410 flow [2024-12-02 14:32:26,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 385 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-12-02 14:32:26,357 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 276 flow [2024-12-02 14:32:26,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2024-12-02 14:32:26,358 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-12-02 14:32:26,358 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 276 flow [2024-12-02 14:32:26,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 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 14:32:26,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:32:26,359 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 14:32:26,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:32:26,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 14:32:26,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:32:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1232240958, now seen corresponding path program 5 times [2024-12-02 14:32:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:32:26,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023734534] [2024-12-02 14:32:26,360 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-02 14:32:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:32:26,407 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 14:32:26,407 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:32:27,618 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 14:32:27,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:32:27,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023734534] [2024-12-02 14:32:27,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023734534] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:32:27,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:32:27,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 14:32:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578801353] [2024-12-02 14:32:27,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:32:27,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 14:32:27,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:32:27,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 14:32:27,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-12-02 14:32:27,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-12-02 14:32:27,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 276 flow. Second operand has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 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 14:32:27,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 14:32:27,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-12-02 14:32:27,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 14:32:28,038 INFO L124 PetriNetUnfolderBase]: 614/1200 cut-off events. [2024-12-02 14:32:28,039 INFO L125 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2024-12-02 14:32:28,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 1200 events. 614/1200 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6528 event pairs, 184 based on Foata normal form. 8/1176 useless extension candidates. Maximal degree in co-relation 3239. Up to 493 conditions per place. [2024-12-02 14:32:28,042 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 32 selfloop transitions, 4 changer transitions 23/74 dead transitions. [2024-12-02 14:32:28,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 74 transitions, 480 flow [2024-12-02 14:32:28,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:32:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 14:32:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-12-02 14:32:28,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2024-12-02 14:32:28,044 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 276 flow. Second operand 8 states and 150 transitions. [2024-12-02 14:32:28,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 74 transitions, 480 flow [2024-12-02 14:32:28,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 471 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-12-02 14:32:28,048 INFO L231 Difference]: Finished difference. Result has 73 places, 44 transitions, 241 flow [2024-12-02 14:32:28,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=241, PETRI_PLACES=73, PETRI_TRANSITIONS=44} [2024-12-02 14:32:28,049 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2024-12-02 14:32:28,049 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 44 transitions, 241 flow [2024-12-02 14:32:28,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 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 14:32:28,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 14:32:28,049 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 14:32:28,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 14:32:28,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-12-02 14:32:28,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:32:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash -145434762, now seen corresponding path program 6 times [2024-12-02 14:32:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:32:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406732954] [2024-12-02 14:32:28,050 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-12-02 14:32:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:32:28,089 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-12-02 14:32:28,089 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 14:32:28,089 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:32:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:32:28,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 14:32:28,164 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:32:28,165 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-12-02 14:32:28,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-12-02 14:32:28,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-12-02 14:32:28,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-12-02 14:32:28,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-12-02 14:32:28,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-12-02 14:32:28,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 14:32:28,167 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2024-12-02 14:32:28,220 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 14:32:28,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:32:28,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:32:28 BasicIcfg [2024-12-02 14:32:28,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:32:28,225 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:32:28,225 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:32:28,225 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:32:28,226 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:32:18" (3/4) ... [2024-12-02 14:32:28,226 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 14:32:28,292 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-12-02 14:32:28,329 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 14:32:28,329 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 14:32:28,329 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:32:28,330 INFO L158 Benchmark]: Toolchain (without parser) took 10667.31ms. Allocated memory was 117.4MB in the beginning and 335.5MB in the end (delta: 218.1MB). Free memory was 90.7MB in the beginning and 122.2MB in the end (delta: -31.6MB). Peak memory consumption was 186.5MB. Max. memory is 16.1GB. [2024-12-02 14:32:28,330 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 72.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:32:28,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.23ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 67.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 14:32:28,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.78ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 64.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:32:28,331 INFO L158 Benchmark]: Boogie Preprocessor took 42.03ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 61.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 14:32:28,331 INFO L158 Benchmark]: RCFGBuilder took 633.53ms. Allocated memory is still 117.4MB. Free memory was 61.6MB in the beginning and 64.2MB in the end (delta: -2.6MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-12-02 14:32:28,332 INFO L158 Benchmark]: TraceAbstraction took 9454.02ms. Allocated memory was 117.4MB in the beginning and 335.5MB in the end (delta: 218.1MB). Free memory was 63.6MB in the beginning and 136.6MB in the end (delta: -73.0MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. [2024-12-02 14:32:28,332 INFO L158 Benchmark]: Witness Printer took 104.10ms. Allocated memory is still 335.5MB. Free memory was 136.6MB in the beginning and 122.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 14:32:28,334 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.21ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 72.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.23ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 67.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.78ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 64.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.03ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 61.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 633.53ms. Allocated memory is still 117.4MB. Free memory was 61.6MB in the beginning and 64.2MB in the end (delta: -2.6MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9454.02ms. Allocated memory was 117.4MB in the beginning and 335.5MB in the end (delta: 218.1MB). Free memory was 63.6MB in the beginning and 136.6MB in the end (delta: -73.0MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. * Witness Printer took 104.10ms. Allocated memory is still 335.5MB. Free memory was 136.6MB in the beginning and 122.2MB in the end (delta: 14.4MB). 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; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 9.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 481 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1006 IncrementalHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 20 mSDtfsCounter, 1006 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=8, InterpolantAutomatonStates: 54, 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.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 1615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 14:32:28,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b1202d-206c-4bc7-9246-3e00e58d688c/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